Advertisement

Research on Tibetan Spelling Formal Language and Automata with Application

  • Nyima Tashi

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Nyima Tashi
    Pages 1-7
  3. Nyima Tashi
    Pages 9-19
  4. Nyima Tashi
    Pages 21-39
  5. Nyima Tashi
    Pages 51-166
  6. Nyima Tashi
    Pages 167-181
  7. Back Matter
    Pages 255-259

About this book

Introduction

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.

Keywords

Tibetan Spelling Grammar Formal Language Computational Linguistics Automata Application

Authors and affiliations

  • Nyima Tashi
    • 1
  1. 1.Tibet UniversityLhasaChina

Bibliographic information

  • DOI https://doi.org/10.1007/978-981-13-0671-6
  • Copyright Information Science Press and Springer Nature Singapore Pte Ltd. 2019
  • Publisher Name Springer, Singapore
  • eBook Packages Social Sciences
  • Print ISBN 978-981-13-0670-9
  • Online ISBN 978-981-13-0671-6
  • Buy this book on publisher's site