Formal languages and applications
Author(s)
Bibliographic Information
Formal languages and applications
(Studies in fuzziness and soft computing, v. 148)
Springer, c2004
Available at 9 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references
Description and Table of Contents
Description
Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.
Table of Contents
1. Basic Notation and Terminology.- 2. Formal Languages: Foundations, Prehistory, Sources, and Applications.- 3. Finite Automata.- 4. Regular Grammars and Languages.- 5. Context-Free Languages.- 6. Pushdown Automata.- 7. On Context-Sensitive Grammars.- 8. Mildly Context-Sensitive Grammars.- 9. Parallel Grammars. A Short Phenomenology.- 10. Equational Axioms for a Theory of Automata.- 11. Turing Machines: Universality and Limits of Computational Power.- 12. Computational Complexity.- 13. Grammars With Regulated Rewriting.- 14. Grammar Systems.- 15. Eco-Grammar Systems.- 16. Miracles, Colonies, and Emergence.- 17. Marcus Contextual Grammars.- 18. Patterns.- 19. Combinatorics on Words.- 20. Combinatorics on Infinite Words.- 21. Finite Tree Automata and Regular Tree Automata. An Introduction.- 22. Two-Dimensional Languages.- 23. String Models and String Theories.- 24. Developmental Languages Versus DNA Computing.- 25. Membrane Computing.- 26. Dialogues on Quantum Computing.- 27. Grammatical Inference and Learning.- 28. Tabular Parsing.- 29. Weighted Finite-State Transducer Algorithms. An Overview.- 30. Text Searching: Theory and Practice.- 31. Cryptography: Basic Theory and Practice.
by "Nielsen BookData"