Preview
Unable to display preview. Download preview PDF.
Literature
I.M. Copi, C.C. Elgot and J.B. Wright, Realization of events by logical nets. J.ACM 5, 181–196 (1958).
J. Dassow, Kleene-Mengen und Kleene-Vollständigkeit. EIK 10, 287–295 (1974).
J. Dassow, Über zwei abgeschlossene Mengen von Automatenoperatoren. Wiss.Zeitschr.d.Univ.Rostock, Math.-Nat.Reihe 1974, 763–767.
J.Dassow, Einige Bemerkungen zu einem modifizierten Vollständigkeitsbegriff für Automatenabbildungen. To appear in Rostokker Math. Kolloquium 3.
P. Dömösi, On the semigroup of automaton mappings with finite alphabet. Acta cybernetica 1, 251–254 (1972).
J. Horejs, Mappings induced by finite automata. Probl. Kibernetiki 9, 23–26 (1963), (russian).
M.I.Kratko, Algorithmic unsolvability of the problem of deciding the completness of finite automata. Dokl.Akad.Nauk 155 (1964), (russian).
W.B. Kudrjavcev, On the cardinality of the set of precomplete sets of functional systems related to automata. Probl.Kibernetiki 13, 45–74 (1965), (russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J. (1977). Some remarks on the algebra of automaton mappings. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_73
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive