Abstract
Two deterministic finite automata
are said to be isomorphic (Greek for “same form”) if there is a one-to-one and onto mapping f : Q M → Q N such that
-
$$f\left( {{s_M}} \right) = {s_N},$$
-
$$f\left( {{\delta _M}\left( {p,a} \right)} \right) = {\delta _N}\left( {f\left( p \right),a} \right) \in {Q_M},\;a \in \sum {} ,\;and$$
-
$$p \in {F_M}\quad iff\quad f\left( p \right) \in {F_{N.}} $$
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
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). Myhill—Nerode Relations. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive