Cantitate/Preț
Produs
Total produse
Vezi coșul
Research on Tibetan Spelling Formal Language and Automata with Application de Nyima Tashi

Research on Tibetan Spelling Formal Language and Automata with Application

Autor Nyima Tashi
en Limba Engleză Hardback – 6 iul 2018
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 52650 lei  6-8 săpt.
  Springer Nature Singapore – 3 ian 2019 52650 lei  6-8 săpt.
Hardback (1) 70205 lei  6-8 săpt.
  Springer Nature Singapore – 6 iul 2018 70205 lei  6-8 săpt.

Preț: 70205 lei

Preț vechi: 82594 lei
-15% Nou

Puncte Express: 1053
Preț estimativ în valută:
13437€ • 13848$ • 11344£

Carte tipărită la comandă

Livrare economică 04-18 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789811306709
ISBN-10: 9811306702
Pagini: 374
Ilustrații: XIII, 259 p. 126 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.56 kg
Ediția:1st ed. 2019
Editura: Springer Nature Singapore
Colecția Springer
Locul publicării:Singapore, Singapore

Cuprins

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. 

Notă biografică

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.

Textul de pe ultima copertă

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.

Caracteristici

The first book on formal language and automata of Tibetan-spelling grammar Includes a Tibetan-spelling formal grammar system Offers a Tibetan-spelling automata group Effectively applies modern technologies to Tibetan-spelling formal language and automata