A criterion for the simplicity of finite Moore automata

András Ádám

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

A criterion for the simplicity of finite Moore automata

András Ádám

Downloads

Download data is not yet available.

PDF

Published

1992-01-01

How to Cite

Ádám, A. (1992). A criterion for the simplicity of finite Moore automata. Acta Cybernetica, 10(4), 221-236. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3408

Download Citation

Issue

Vol 10 No 4 (1992)

Section

Regular articles

Most read articles by the same author(s)

András Ádám, On certain partitions of finite directed graphs and of finite automata , Acta Cybernetica: Vol 6 No 4 (1984)
András Ádám, On the congruences of finite autonomous Moore automata , Acta Cybernetica: Vol 7 No 3 (1986)
Masashi Katsura, András Ádám, On a problem of Ádám concerning precodes assigned to finite Moore automata , Acta Cybernetica: Vol 8 No 2 (1987)
András Ádám, On some cyclic connectivity properties of directed graphs : examples and problems , Acta Cybernetica: Vol 14 No 1 (1999)
András Ádám, On some algebraic properties of automata , Acta Cybernetica: Vol 15 No 1 (2001)
András Ádám, Pál Dömösi, Publications of László Kalmár , Acta Cybernetica: Vol 18 No 1 (2007)

<< < 1 2