Skip to main content
  • 100 Accesses

Abstract

The research on Tibetan spelling formal language and automata with application is related to set, function, graph, computer formal language and automata theory.

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

Access this chapter

eBook
USD 16.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

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nyima Tashi .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Science Press and Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Nyima Tashi (2019). Theoretical Basis. In: Research on Tibetan Spelling Formal Language and Automata with Application. Springer, Singapore. https://doi.org/10.1007/978-981-13-0671-6_3

Download citation

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

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0670-9

  • Online ISBN: 978-981-13-0671-6

  • eBook Packages: Social SciencesSocial Sciences (R0)

Publish with us

Policies and ethics