Regulated grammars and automata [electronic resource] / Alexander Meduna, Petr Zemek.
Meduna, Alexander, 1957- author.; Zemek, Petr, author.
2014
QA267.3
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title Regulated grammars and automata [electronic resource] / Alexander Meduna, Petr Zemek.
Author Meduna, Alexander, 1957- author.
ISBN 9781493903696 electronic book
1493903691 electronic book
9781493903689
1493903683
DOI https://doi.org/10.1007/978-1-4939-0369-6
Published New York : Springer, [2014]
Language English
Description 1 online resource (690 pages) : illustrations
Other Standard Identifiers 10.1007/978-1-4939-0369-6 doi
Call Number QA267.3
Dewey Decimal Classification 005.1
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.
Bibliography, etc. Note Includes bibliographical references and indexes.
Access Note Access limited to authorized users.
Source of Description Description based on print version record.
Added Author Zemek, Petr, author.
Available in Other Form Regulated grammars and automata. Alexander Meduna, Petr Zemek
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export