A criterion for the simplicity of finite Moore automata

Most read articles by the same author(s)

• András Ádám, U. Kling, On the behaviour of some cyclically symmetric networks , Acta Cybernetica: Vol 1 No 2 (1971)
• András Ádám, On some generalizations of cyclic networks , Acta Cybernetica: Vol 1 No 2 (1971)
• András Ádám, János Bagyinszki, On some enumeration questions concerning trees and tree-type networks : to the memory of Dr Catherine Rényi and professor Alfréd Rényi , Acta Cybernetica: Vol 1 No 3 (1972)
• Gabor T. Herman, Zoltán M. Hantos, Lajos Klukovits, Imre Pávó, András Ádám, U. Kling, A. Máté, J. Szűcs, K. Bellmann, Michael Gössel, Ferenc Móricz, Dániel Muszka, Attila Sára, János Bagyinszki, György Révész, F. Ferenczy, András Pellionisz, Ferenc Forgó, Annamária G. Varga, Rózsa Péter, János Demetrovics, B. Papp, Pál Dömösi, Wilhelm Kämmerer, E. Vida, Lubomir Georgiev Iliev, Rezûm statej pervogo toma Acta Cybernetica , Acta Cybernetica: Vol 1 No 4 (1972)
• András Ádám, On some aspects of the algebraic description of automaton mappings , Acta Cybernetica: Vol 2 No 1 (1973)
• András Ádám, An application of truth functions in formalized diagnostics , Acta Cybernetica: Vol 2 No 4 (1976)
• András Ádám, On graphs satisfying some conditions for cycles, I. , Acta Cybernetica: Vol 3 No 1 (1976)
• András Ádám, On graphs satisfying some conditions for cycles, II. , Acta Cybernetica: Vol 3 No 2 (1977)
• András Ádám, On some open problems of applied automaton theory and graph theory : suggested by the mathematical modelling of certain neuronal networks , Acta Cybernetica: Vol 3 No 3 (1977)
• András Ádám, On the complexity of codes and pre-codes assigned to finite Moore automata , Acta Cybernetica: Vol 5 No 2 (1981)