Authors:
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
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (22 chapters)
-
Front Matter
-
Introduction and Terminology
-
Front Matter
-
-
Regulated Grammars: Fundamentals
-
Front Matter
-
-
Regulated Grammars: Parallelism
-
Front Matter
-
-
Regulated Grammar Systems
-
Front Matter
-
About this book
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
-
Department of Information Systems, Brno University of Technology, Brno, Czech Republic
Alexander Meduna, Petr Zemek
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