This book applies formal language and automata theory in the context of Tibetan computational linguistics; further, it constructs a Tibetan-spelling formal grammar system that generates a Tibetan-spelling formal language group, and an automata group that can recognize the language group. In addition, it investigates the application technologies of Tibetan-spelling formal language and automata. Given its creative and original approach, the book offers a valuable reference guide for researchers, teachers and graduate students in the field of computational linguistics.

Research on Tibetan Spelling Formal Language and Automata with Application, Nyima Tashi, 2019 Edition, Springer, Hardcover, 272 pp, $100.00

Nyima Tashi completed his bachelor's degree in Computer Science at East China Normal University, Shanghai, China and his Ph.D. in Computer Application Technology at Sichuan University, Chengdu, China. He is currently a Professor of Computer Science at Tibet University, Lhasa, China. His research interests include computer networks, Tibetan Information Technology and Tibetan computational linguistics. He has won the National Science and Technology Progress Award (second prize) and the Tibet Autonomous Region Science and Technology Award (first prize and second prize). He has also been selected for a number of national talent support programs, and was granted a special allowance by the State Council.

CONTENTS: Research on Tibetan Spelling Formal Language and Automata with Application
1	Tibetan			1
	1.1	Brief Introduction to Tibetan		1
		1.1.1	The Origin and Collation of Tibetan	1
		1.1.2	Ancient Literatures of Tibetan	2
		1.1.3	Use of Tibetan	3
	1.2	Tibetan Words		4
		1.2.1	Tibetan Consonant Alphabets, Vowel Signs and Punctuation Marks	5
		1.2.2	Writing and Fonts of Tibetan	6
		1.2.3	Basic Structure of Tibetan	6
2	Tibetan Spelling Grammar			9
	2.1	Tibetan Spelling Grammar		9
		2.1.1	Vertical Combining Spelling	9
		2.1.2	Spelling of Prefix Characters	10
		2.1.3	Spelling of Suffix Characters	12
		2.1.4	Spelling of Postfix Characters	12
		2.1.5	Others	12
	2.2	Basic Spelling Structure of Tibetan		12
3	Theoretical Basis			21
	3.1	Mathematical Basis		21
		3.1.1	Set	21
		3.1.2	String	23
		3.1.3	Function	25
		3.1.4	Graph	25
	3.2	Formal Language		26
		3.2.1	Overview	26
		3.2.2	Formal Grammar	27
		3.2.3	Types of Formal Grammar	29
		3.2.4	Automata	31
		3.2.5	Regular Grammar and Automata	36
4	Formal Description of Tibetan Spelling Grammar			41
	4.1	Definition of Terms		41
		4.1.1	Definition	41
		4.1.2	Symbol Mapping	43
	4.2	Formal Description of Tibetan Spelling Grammar		44
	4.3	Nature of Tibetan Spelling Grammar		48
5	Tibetan Spelling Formal Language			51
	5.1	Overview of Tibetan Spelling Formal Language		51
	5.2	Tibetan Spelling Formal Grammar 1		53
	5.3	Tibetan Spelling Formal Grammar 2		110
	5.4	Ambiguity in Use of Tibetan Spelling Formal Grammar		165
6	Computer-Based Tibetan Coding			167
	6.1	Coding Mode for Tibetan Characters		168
	6.2	GB16959-1977 Information Technology--Tibetan Coded Character Sets for Information Interchange--Basic Set		169
		6.2.1	Scope	170
		6.2.2	Reference Standards	170
		6.2.3	Definition	170
		6.2.4	Form of Code Expressing	171
		6.2.5	Combined Use of Control Function and This Standard	171
		6.2.6	Statement	172
	6.3	Code Expression of Tibetan		172
	6.4	Recognition of Constituents of Tibetan Words		177
7	Tibetan Spelling Formal Language Application			183
	7.1	Application in Computer-Based Tibetan Intelligent Input Method		183
		7.1.1	Layout of Non-repeated-Code Tibetan Computer Keyboard	183
		7.1.2	Tibetan Spelling Formal Grammar 3	188
		7.1.3	Intelligent Input Method of Tibetan	224
	7.2	Application in Computer-Based Tibetan Automatic Spelling Check		231
		7.2.1	Tibetan Automatic Spelling Check and Tibetan Spelling Formal Language	231
		7.2.2	Realization of Tibetan Automatic Spelling Check	232
	7.3	Application in Computer-Based Tibetan Automatic Sorting		243
		7.3.1	Sorting Rules for Tibetan	244
		7.3.2	Sorting Method of Tibetan Words	246
		7.3.3	Sorting Method of Tibetan Expressions	251
Bibliography				255