Beschreibung
InhaltsangabeBasic Notation and Terminology.- Formal Languages: Foundations, Prehistory, Sources, and Applications.- Finite Automata.- Regular Grammars and Languages.- ContextFree Languages.- Pushdown Automata.- On ContextSensitive Grammars.- Mildly ContextSensitive Grammars.- Parallel Grammars: A Short Phenomenology.- Equational Axioms for a Theory of Automata.- Turing Machines: Universality and Limits of Computational Power.- Computational Complexity.- Grammars With Regulated Rewriting.- Grammar Systems.- EcoGrammar Systems.- Miracles, Colonies, and Emergence.- Marcus Contextual Grammars.- Patterns.- Combinatorics on Words.- Combinatorics on Infinite Words.- Finite Tree Automata and Regular Tree Automata.- TwoDimensional Languages.- String Models and String Theories.- Developmental Languages Versus DNA Computing.- Membrane Computing.- Dialogues on Quantum Computing.- Grammatical Inference and Learning.- Tabular Parsing.- Weighted FiniteState Transducer Algorithms.- Text Searching.- Cryptography.
Inhaltsverzeichnis
Basic Notation and Terminology.- Formal Languages: Foundations, Prehistory, Sources, and Applications.- Finite Automata.- Regular Grammars and Languages.- ContextFree Languages.- Pushdown Automata.- On ContextSensitive Grammars.- Mildly ContextSensitive Grammars.- Parallel Grammars: A Short Phenomenology.- Equational Axioms for a Theory of Automata.- Turing Machines: Universality and Limits of Computational Power.- Computational Complexity.- Grammars With Regulated Rewriting.- Grammar Systems.- EcoGrammar Systems.- Miracles, Colonies, and Emergence.- Marcus Contextual Grammars.- Patterns.- Combinatorics on Words.- Combinatorics on Infinite Words.- Finite Tree Automata and Regular Tree Automata.- TwoDimensional Languages.- String Models and String Theories.- Developmental Languages Versus DNA Computing.- Membrane Computing.- Dialogues on Quantum Computing.- Grammatical Inference and Learning.- Tabular Parsing.- Weighted FiniteState Transducer Algorithms.- Text Searching.- Cryptography.
Autorenporträt
Inhaltsangabe1. 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.
