This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Note that this is not the only way of doing this: we could show (1) and then for (2) show that every string that is non-acceptable to M is rejected by M d. You might like to try this approach.
- 2.
Bear in mind that the class of the context free grammars includes the class of the regular grammars.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
Parkes, A.P. (2008). Regular Languages and Finite State Recognisers. In: A Concise Introduction to Languages and Machines. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84800-121-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-84800-121-3_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-120-6
Online ISBN: 978-1-84800-121-3
eBook Packages: Computer ScienceComputer Science (R0)