Regulated Grammars and Automata

Alexander Meduna, Petr Zemek (Autoren)

Buch | Softcover

694 Seiten

2016 | Softcover reprint of the original 1st ed. 2014
Springer-Verlag New York Inc.
978-1-4939-4316-6 (ISBN)

Artikel merken

This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. Key topics include formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages.

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 regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages. The book explores how the information utilized in computer science is most often represented by formal languages defined by appropriate formal devices. It provides both algorithms and a variety of real-world applications, allowing readers to understand both theoretical concepts and fundamentals. There is a special focus on applications to scientific fields including biology, linguistics and informatics. This book concludes with case studies and future trends for the field. Regulated Grammars and Automata is designed as a reference for researchers and professionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary textbook or reference.

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.

Erscheinungsdatum	15.09.2016
Zusatzinfo	12 Illustrations, black and white; XX, 694 p. 12 illus.
Verlagsort	New York
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
	Mathematik / Informatik ► Informatik ► Theorie / Studium
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
Schlagworte	algorithms • Automata • Control languages • Deep pushdown automata • Formal applications • Grammars • Linguistics • Parallel • Programmed grammars • regulated • Scattered context grammars • Self-regulating finite automata • theoretical computer science
ISBN-10	1-4939-4316-2 / 1493943162
ISBN-13	978-1-4939-4316-6 / 9781493943166
Zustand	Neuware