Regulated Grammars and Automata

ISBN-13: 9781493903689 / Angielski / Twarda / 2014 / 694 str.

Alexander Meduna; Petr Zemek

Opis

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.

Recenzje

From the book reviews:

"The book consists of 22 chapters divided among nine parts. ... The book is well written and produced, and should be warmly received by its community. Each chapter is accompanied by a bibliography, and the authors suggest many open problems that should be welcomed by researchers, especially graduate students just embarking on research." (Shrisha Rao, Computing Reviews, November, 2014)

Spis treści

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.

O autorze

Alexander Meduna, Associate Professor of Computer Science at the Brno University of Technology, received his PhD from Brno University in 1988. He has taught theoretical computer science at various European and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of formal language theory.