Abstract
This chapter introduces regular grammars and their equivalence with finite-state machines.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Morazán, M.T. (2024). Regular Grammars. In: Programming-Based Formal Languages and Automata Theory. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-43973-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-43973-5_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43972-8
Online ISBN: 978-3-031-43973-5
eBook Packages: Computer ScienceComputer Science (R0)