Regular grammars, Type 3 grammars, are the simplest form of grammars that still have generative power. They can describe concatenation (joining two strings together) and repetition, and can specify alternatives, but they cannot express nesting. Regular grammars are probably the best-understood part of formal linguistics and almost all questions about them can be answered.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Grune, D., Jacobs, C.J.H. (2008). Regular Grammars and Finite-State Automata. In: Parsing Techniques. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68954-8_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-68954-8_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20248-8
Online ISBN: 978-0-387-68954-8
eBook Packages: Computer ScienceComputer Science (R0)