1 option
Regulated Grammars and Automata / by Alexander Meduna, Petr Zemek.
- Format:
- Book
- Author/Creator:
- Meduna, Alexander, 1957- author.
- Zemek, Petr, 1970- author.
- Series:
- Computer Science (Springer-11645)
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- 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.
- Local Subjects:
- Theory of Computation.
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Mathematics of Computing.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XX, 694 pages) : 12 illustrations
- Edition:
- First edition 2014.
- Contained In:
- Springer eBooks
- Place of Publication:
- New York, NY : Springer New York : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-1-4939-0369-6
- 9781493903696
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.