This is a preview of subscription content, log in via an institution to check access.
References
A. Ádám, On the question of description of the behaviour of finite automata,Studia Sci. Math. Hungar. 13 (1978), 105–124.MR 83i: 68079
A. Ádám, On the complexity of codes and pre-codes assigned to finite Moore automata,Acta Cybernet. (Szeged)5 (1981), 117–133.MR 83c: 68055
A. Ádám, On the simplicity of finite autonomous Moore automata,Studia Sci. Math. Hungar. 16 (1981), 427–436.MR 85h: 68058
A. Ádám, On certain partitions of finite directed graphs and of finite automata,Acta Cybernet. (Szeged)6 (1984), 331–346.MR 86e: 05069
M. Katsura, On complexity of finite Moore automata,Acta Cybernet. (Szeged)7 (1986), 281–292.
M. Katsura, Finiteness of complexity for precodes assigned to finite Moore automata,Topics in the theoretical bases and applications of Computer Science (Proc. Conf., Győr, July 1985), Akadémiai Kiadó, Budapest, 1986; 91–102.
M. Katsura, Leaves of precodes assigned to finite Moore automata,Studia Sci. Math. Hungar. (To appear)
M. Katsura, On a problem of Ádám concerning precodes assigned to finite Moore automata,Acta Cybernet. (Szeged). (To appear)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Katsura, M. On the complexity of finite autonomous Moore automata. Period Math Hung 18, 151–167 (1987). https://doi.org/10.1007/BF01896290
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01896290