Complete finite automata network graphs with minimal number of edges

Most read articles by the same author(s)

• Pál Dömösi, On the semigroup of automaton mappings with finite alphabet , Acta Cybernetica: Vol 1 No 4 (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)
• Pál Dömösi, On superpositions of automata , Acta Cybernetica: Vol 2 No 4 (1976)
• Pál Dömösi, On minimal incomplete R-systems of finite automata , Acta Cybernetica: Vol 3 No 1 (1976)
• Pál Dömösi, On homomorphically αi-complete systems of automata , Acta Cybernetica: Vol 6 No 1 (1983)
• Pál Dömösi, Balázs Imreh, On vi-products of automata , Acta Cybernetica: Vol 6 No 2 (1983)
• Pál Dömösi, Zoltán Ésik, On the hierarchy of vi-products of automata , Acta Cybernetica: Vol 8 No 3 (1988)
• Pál Dömösi, Zoltán Ésik, On homomorphic simulation of automata by α0-products , Acta Cybernetica: Vol 8 No 4 (1988)
• Pál Dömösi, Zoltán Ésik, Product hierarchies of automata and homomorphic simulation , Acta Cybernetica: Vol 9 No 4 (1990)
• Pál Dömösi, Unusual algorithms for lexicographical enumeration , Acta Cybernetica: Vol 14 No 3 (2000)