Mealy-automata in which the output-equivalence is .a congruence

Most read articles by the same author(s)

• István Babcsányi, Equivalence of Mealy and Moore automata , Acta Cybernetica: Vol. 14 No. 4 (2000)
• Zoltán Fülöp, István Babcsányi, Attila Nagy, Correction : Mealy-automata in which the output-equivalence is a congruence : I. Babcsányi, A. Nagy , Acta Cybernetica: Vol. 12 No. 1 (1995)
• István Babcsányi, Automata with finite congruence lattices , Acta Cybernetica: Vol. 18 No. 1 (2007)
• Attila Nagy, Boolean-type retractable automata with traps , Acta Cybernetica: Vol. 10 No. 1-2 (1991)
• István Babcsányi, Attila Nagy, Right group-type automata , Acta Cybernetica: Vol. 12 No. 2 (1995)
• István Babcsányi, Endomorphisms of group-type quasi-automata , Acta Cybernetica: Vol. 2 No. 4 (1976)
• István Babcsányi, Characteristically free quasi-automata , Acta Cybernetica: Vol. 3 No. 2 (1977)
• Attila Nagy, Retractable state-finite automata without outputs , Acta Cybernetica: Vol. 16 No. 3 (2004)