Publication Details
Regulated Grammars and Automata
Zemek Petr, Ing., Ph.D.
formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages
This book offers 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.
@book{BUT111518,
author="Alexandr {Meduna} and Petr {Zemek}",
title="Regulated Grammars and Automata",
year="2014",
publisher="Springer US",
address="New York",
pages="694",
doi="10.1007/978-1-4939-0369-6",
isbn="978-1-4939-0368-9",
url="http://www.springer.com/computer/theoretical+computer+science/book/978-1-4939-0368-9"
}