Abstract
There is no finite system of automata which is complete with respect to the α0-product. We show the existence of such finite systems if we restrict ourselves to representations of automaton mappings in finite but unbounded lengths. It will also be seen that in this representation the α0-product is as powerful as the general product. This will follow from the result that, for an arbitrary class K of automata, the minimal equational class containing K and closed under the infinite α0-product coincides with the minimal equational class containing K and closed under the infinite general product.
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). Representation of Automaton Mappings in Finite Length. Infinite Products. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-61611-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64884-7
Online ISBN: 978-3-642-61611-2
eBook Packages: Springer Book Archive