Complete finite automata network graphs with minimal number of edges

Pál Dömösi; Chrystopher L. Nehaniv

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

Complete finite automata network graphs with minimal number of edges

Pál Dömösi
Chrystopher L. Nehaniv

Downloads

Download data is not yet available.

PDF

Published

1999-01-01

How to Cite

Dömösi, P., & Nehaniv, C. L. (1999). Complete finite automata network graphs with minimal number of edges. Acta Cybernetica, 14(1), 37-50. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3509

Download Citation

Issue

Vol 14 No 1 (1999)

Section

Regular articles

Most read articles by the same author(s)

Pál Dömösi, Satoshi Okawa, A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages , Acta Cybernetica: Vol 15 No 1 (2001)
Attila Egri-Nagy, Chrystopher L. Nehaniv, Cycle structure in automata and the holonomy decomposition , Acta Cybernetica: Vol 17 No 2 (2005)
András Ádám, Pál Dömösi, Publications of László Kalmár , Acta Cybernetica: Vol 18 No 1 (2007)
Pál Dömösi, Géza Horváth, A novel cryptosystem based on Gluškov product of automata , Acta Cybernetica: Vol 22 No 2 (2015)
Pál Dömösi, Szilárd Fazekas, Masami Ito, On Chomsky Hierarchy of Palindromic Languages , Acta Cybernetica: Vol 22 No 3 (2016)
Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi, Statistical analysis of DH1 cryptosystem , Acta Cybernetica: Vol 23 No 1 (2017)

<< < 1 2