Abstract
On the basis of the explanation on formal language as given in 3.2 hereof, we can define Tibetan words as the language on alphabet L (L = {b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33, b34, b35, i, u, e, o, a}).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Science Press and Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Nyima Tashi (2019). Tibetan Spelling Formal Language. In: Research on Tibetan Spelling Formal Language and Automata with Application. Springer, Singapore. https://doi.org/10.1007/978-981-13-0671-6_5
Download citation
DOI: https://doi.org/10.1007/978-981-13-0671-6_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-0670-9
Online ISBN: 978-981-13-0671-6
eBook Packages: Social SciencesSocial Sciences (R0)