Formal Languages and Applications

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Martin-Vide, Carlos (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Mitrana, Victor (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Păun, Gheorghe (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
• Έκδοση: 1st ed. 2004.
• Σειρά: Studies in Fuzziness and Soft Computing, 148
• Θέματα: Applied mathematics.; Engineering mathematics.; Programming languages (Electronic computers).; Artificial intelligence.; Natural language processing (Computer science).; Mathematical logic.; Mathematical and Computational Engineering.; Applications of Mathematics.; Programming Languages, Compilers, Interpreters.; Artificial Intelligence.; Natural Language Processing (NLP).; Mathematical Logic and Foundations.

"Formal Languages and Applications" provides an overall course-aid and self-study material for graduates students and researchers in formal language theory and its applications. The main results and techniques are presented in an easily accessible way accompanied with many references and...

Πίνακας περιεχομένων:

• 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.