Minimal ascending tree automata

Ferenc Gécseg; Magnus Steinby

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

Minimal ascending tree automata

Ferenc Gécseg
Magnus Steinby

Downloads

Download data is not yet available.

PDF

Published

1978-01-01

How to Cite

Gécseg, F., & Steinby, M. (1978). Minimal ascending tree automata. Acta Cybernetica, 4(1), 37-44. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3164

Download Citation

Issue

Vol 4 No 1 (1978)

Section

Regular articles

Most read articles by the same author(s)

Ferenc Gécseg, Balázs Imreh, On isomorphic representations of generalized definite automata , Acta Cybernetica: Vol 15 No 1 (2001)
Ferenc Gécseg, György Gyurica, On the closedness of nilpotent DR tree languages under Boolean operations , Acta Cybernetica: Vol 17 No 3 (2006)
Ferenc Gécseg, György Turán, Foreword , Acta Cybernetica: Vol 18 No 1 (2007)
Ferenc Gécseg, Classes of tree languages and DR tree languages given by classes of semigroups , Acta Cybernetica: Vol 20 No 2 (2011)
Ferenc Gécseg, Ferenc Gécseg : 1939-2014 , Acta Cybernetica: Vol 21 No 4 (2014)
Magnus Steinby, Rectangular algebras as tree recognizers , Acta Cybernetica: Vol 22 No 2 (2015)
Magnus Steinby, On DR tree automata, unary algebras and syntactic path monoids , Acta Cybernetica: Vol 23 No 1 (2017)

<< < 1 2