Regulated Grammars and Automata

ISBN-13: 9781493943166 / Angielski / Miękka / 2016 / 694 str.

Alexander Meduna; Petr Zemek

Opis

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.

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.