Abstract
We now use a representation stronger than that studied in the previous chapter: we shall deal with isomorphic representations. It will be seen that there is no finite isomorphically complete system with respect to any of the α i -products. Moreover, as regards isomorphic representation the products form a proper hierarchy, and from i = 1 they are equivalent to each other with respect to isomorphic completeness.
This is a preview of subscription content, log in via an institution to check access.
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
© 1986 Springer-Verlag Berlin Haidelberg
About this chapter
Cite this chapter
Gécseg, F. (1986). Isomorphic Representations. In: Products of Automata. EATCS Monographs in Theoretical Computer Science, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61611-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-61611-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64884-7
Online ISBN: 978-3-642-61611-2
eBook Packages: Springer Book Archive