LEADER 01657cmm 2200217 a 450

001 298363

008 180620s2019 cc s 0 eng d

020 $a9789811306716$q(electronic bk.)

020 $a9789811306709$q(paper)

035 $a00350591

041 0 $aeng

050 4$aP98.45.T58$bT374 2019

082 04$a410.285$223

090 $aE-BOOK/410.285///UE033685

100 1 $aTashi Nyima.$3533145

245 10$aResearch on Tibetan spelling formal language and automata with application$h[electronic resource] /$cby Nyima Tashi.

260 $aBeijing, China :$bScience Press ;$aSingapore :$bSpringer Nature Singapore,$c2019.

300 $axiii, 259 p. :$bill., digital ;$c24 cm.

505 0 $aBrief 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 $aThis 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$aComputational linguistics.$3174635

650 0$aElectronic data processing.$3145130

650 0$aInformation technology$zChina$zTibet Autonomous Region.$3533146

650 14$aLinguistics.$3157104

650 24$aComputational Linguistics.$3402142

650 24$aLanguage Translation and Linguistics.$3402144

710 2 $aSpringerLink (Online service)$3374217

773 0 $tSpringer eBooks

856 40$uhttps://erm.library.ntpu.edu.tw/login?url=http://dx.doi.org/10.1007/978-981-13-0671-6$z線上閱讀(Springer)

950 $aSocial Sciences (Springer-41176)

網路資源：

• 線上閱讀(Springer)