By now, You are familiar with regular expressions, regular grammars, deterministic finite automata, and nondeterministic finite automata. Are they talking about the same class of languages? The examples in the last chapter, at least, suggest that they might. In this chapter, we will see that it is indeed so. We will say, informally, that two mechanisms are equivalent if they accept the same class of languages. In fact, we solve many subproblems to arrive at these equivalences. Our route is from NFA to DFA, from DFA to regular grammar, from regular grammar to NFA, from regular expression to NFA, and finally, from NFA to regular expression.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2009). Equivalences. In: Elements of Computation Theory. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84882-497-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-84882-497-3_3
Publisher Name: Springer, London
Print ISBN: 978-1-84882-496-6
Online ISBN: 978-1-84882-497-3
eBook Packages: Computer ScienceComputer Science (R0)