Regulated Grammars and Automata

• Κύριοι συγγραφείς: Meduna, Alexander (Συγγραφέας), Zemek, Petr (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York : Imprint: Springer, 2014.
• Θέματα: Computer science.; Computers.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Theory of Computation.; Computation by Abstract Devices.; Mathematical Logic and Formal Languages.; Mathematics of Computing.; Discrete Mathematics in Computer Science.

This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls represented by additional mathematical mechanisms. Key topics include formal language theory, grammatical...

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

• Introduction
• Mathematical Background
• Rudiments of Formal Language Theory
• Context-Based Grammatical Regulation
• Rule-Based Grammatical Regulation
• One-Sided Versions of Random Context Grammars
• On Erasing Rules and Their Elimination
• Extension of Languages Resulting from Regulated Grammars
• Sequential Rewriting over Word Monoids
• Regulated ET0L Grammars
• Uniform Regulated Rewriting in Parallel
• Parallel Rewriting over Word Monoids
• Regulated Multigenerative Grammar Systems
• Controlled Pure Grammar Systems
• Self-Regulating Automata
• Automata Regulated by Control Languages
• Jumping Finite Automata
• Deep Pushdown Automata
• Applications: Overview
• Case Studies
• Concluding Remarks
• Summary.