Preview
Unable to display preview. Download preview PDF.
References
BAVEL, Z.: Structure and transition-preserving function of finite automata. J. Assoc. Comput. Mach. 15, 1 (1968), 135–158.
FLECK, A.C.: Isomorphism groups of automata. J. Assoc. Comput. Mach. 9, 4 (1962), 469–476.
GILL, A.: Time-varying sequential machines. J. Franklin Inst. 276, 6 (1963), 519–539.
GRZYMALA-BUSSE, J.W.: Automorphisms of polyadic automata. J. Assoc. Comput. Mach. 16, 2 (1969), 208–219. Err.:646.
—: On the periodic representations and the reducibility of periodic automata. J. Assoc. Comput. Mach. 16, 3 (1969), 432–441. Err.: 17, 4 (1970), 739.
—: Periodic representations and T-partitionable equivalents of sequential machines. IEEE Trans. Computers C-20, 2 (1971), 190–198.
WEEG, G.P.: The structure of an automaton and its operation-preserving transformation group. J. Assoc. Comput. Mach. 9, 3 (1962), 345–349.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grzymala-Busse, J.W. (1975). On the periodic sum and extensions of finite automata. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_666
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_666
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive