Research on Tibetan Spelling Formal Language and Automata with Application

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Nyima Tashi (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Singapore : Springer Singapore : Imprint: Springer, 2019.
Έκδοση:1st ed. 2019.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02606nam a2200457 4500
001 978-981-13-0671-6
003 DE-He213
005 20190618051323.0
007 cr nn 008mamaa
008 180620s2019 si | s |||| 0|eng d
020 |a 9789811306716  |9 978-981-13-0671-6 
024 7 |a 10.1007/978-981-13-0671-6  |2 doi 
040 |d GrThAP 
050 4 |a P98-98.5 
072 7 |a CFX  |2 bicssc 
072 7 |a LAN009000  |2 bisacsh 
072 7 |a CFX  |2 thema 
082 0 4 |a 410.285  |2 23 
100 1 |a Nyima Tashi.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Research on Tibetan Spelling Formal Language and Automata with Application  |h [electronic resource] /  |c by Nyima Tashi. 
250 |a 1st ed. 2019. 
264 1 |a Singapore :  |b Springer Singapore :  |b Imprint: Springer,  |c 2019. 
300 |a XIII, 259 p. 126 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. . 
520 |a 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. 
650 0 |a Computational linguistics. 
650 0 |a Natural language processing (Computer science). 
650 1 4 |a Computational Linguistics.  |0 http://scigraph.springernature.com/things/product-market-codes/N22000 
650 2 4 |a Natural Language Processing (NLP).  |0 http://scigraph.springernature.com/things/product-market-codes/I21040 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9789811306709 
776 0 8 |i Printed edition:  |z 9789811306723 
776 0 8 |i Printed edition:  |z 9789811344763 
856 4 0 |u https://doi.org/10.1007/978-981-13-0671-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SLS 
950 |a Social Sciences (Springer-41176)