Overview
- Offers key theoretical topics and terminology concerning regulated grammars and automata
- Includes real-world applications and future trends in the field
- Covers easy-to-follow theoretical concepts and fundamentals
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
Table of contents (22 chapters)
-
Introduction and Terminology
-
Regulated Grammars: Fundamentals
-
Regulated Grammars: Special Topics
-
Regulated Grammars: Parallelism
-
Regulated Grammar Systems
Reviews
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)Authors and Affiliations
Bibliographic Information
Book Title: Regulated Grammars and Automata
Authors: Alexander Meduna, Petr Zemek
DOI: https://doi.org/10.1007/978-1-4939-0369-6
Publisher: Springer New York, NY
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Science+Business Media New York 2014
Hardcover ISBN: 978-1-4939-0368-9Published: 04 March 2014
Softcover ISBN: 978-1-4939-4316-6Published: 03 September 2016
eBook ISBN: 978-1-4939-0369-6Published: 08 July 2014
Edition Number: 1
Number of Pages: XX, 694
Number of Illustrations: 12 b/w illustrations
Topics: Theory of Computation, Computation by Abstract Devices, Mathematical Logic and Formal Languages, Mathematics of Computing, Discrete Mathematics in Computer Science