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

István Babcsányi; Attila Nagy

Skip to main content Skip to main navigation menu Skip to site footer

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

István Babcsányi
Attila Nagy

Downloads

Download data is not yet available.

PDF

Published

1994-01-01

How to Cite

Babcsányi, I., & Nagy, A. (1994). Mealy-automata in which the output-equivalence is .a congruence. Acta Cybernetica, 11(3), 121-126. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3424

Download Citation

Issue

Vol 11 No 3 (1994)

Section

Regular articles

Most read articles by the same author(s)

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, Boolean-type retractable automata with traps , Acta Cybernetica: Vol 10 No 1-2 (1991)
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, Attila Nagy, Right group-type automata , Acta Cybernetica: Vol 12 No 2 (1995)
István Babcsányi, Equivalence of Mealy and Moore automata , Acta Cybernetica: Vol 14 No 4 (2000)
Attila Nagy, Retractable state-finite automata without outputs , Acta Cybernetica: Vol 16 No 3 (2004)
István Babcsányi, Automata with finite congruence lattices , Acta Cybernetica: Vol 18 No 1 (2007)