Research on Tibetan Spelling Formal Language and Automata with Application

1. Auflage 2019
ISBN: 978-981-13-0671-6
Verlag: Springer Singapore
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 259 Seiten, eBook

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.

Zielgruppe

Research

Inhaltsverzeichnis

Brief Introduction_Preface.- Foreword.- Tibetan.- Tibetan Spelling Grammar.- Theoretical Basis.- Formal Description of Tibetan spelling Grammar.- Tibetan Spelling Formal Language.- Computer-based Tibetan Coding.- 7. Tibetan Spelling Formal Language Application.- References.

Über Autor(innen)

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.