Skip to main content
SpringerLink
Log in
Book cover

Research on Tibetan Spelling Formal Language and Automata with Application

  • Book
  • © 2019

Overview

Authors:
  1. Nyima Tashi

    1. Tibet University, Lhasa, China

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

  • 744 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Tibetan

    • Nyima Tashi
    Pages 1-7

  3. Tibetan Spelling Grammar

    • Nyima Tashi
    Pages 9-19

  4. Theoretical Basis

    • Nyima Tashi
    Pages 21-39

  5. Formal Description of Tibetan Spelling Grammar

    • Nyima Tashi
    Pages 41-49

  6. Tibetan Spelling Formal Language

    • Nyima Tashi
    Pages 51-166

  7. Computer-Based Tibetan Coding

    • Nyima Tashi
    Pages 167-181

  8. Tibetan Spelling Formal Language Application

    • Nyima Tashi
    Pages 183-254

  9. Back Matter

    Pages 255-259
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Tibet University, Lhasa, China

    Nyima Tashi

About the author

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.

Bibliographic Information

  • Book Title: Research on Tibetan Spelling Formal Language and Automata with Application

  • Authors: Nyima Tashi

  • DOI: https://doi.org/10.1007/978-981-13-0671-6

  • Publisher: Springer Singapore

  • eBook Packages: Social Sciences, Social Sciences (R0)

  • Copyright Information: Science Press and Springer Nature Singapore Pte Ltd. 2019

  • Hardcover ISBN: 978-981-13-0670-9Published: 06 July 2018

  • Softcover ISBN: 978-981-13-4476-3Published: 03 January 2019

  • eBook ISBN: 978-981-13-0671-6Published: 20 June 2018

  • Edition Number: 1

  • Number of Pages: XIII, 259

  • Number of Illustrations: 126 b/w illustrations

  • Topics: Computational Linguistics, Natural Language Processing (NLP)

Publish with us

Policies and ethics

Back to top

Search

Navigation