Minimal ascending tree automata

Most read articles by the same author(s)

• Balázs Imreh, Magnus Steinby, Directable nondeterministic automata , Acta Cybernetica: Vol. 14 No. 1 (1999)
• Magnus Steinby, On DR tree automata, unary algebras and syntactic path monoids , Acta Cybernetica: Vol. 23 No. 1 (2017)
• 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, Balázs Imreh, On metric equivalence of vi-products , Acta Cybernetica: Vol. 8 No. 2 (1987)
• Balázs Imreh, Magnus Steinby, Some remarks on directable automata , Acta Cybernetica: Vol. 12 No. 1 (1995)
• Magnus Steinby, Rectangular algebras as tree recognizers , Acta Cybernetica: Vol. 22 No. 2 (2015)
• Zoltán Ésik, Ferenc Gécseg, General products and equational classes of automata , Acta Cybernetica: Vol. 6 No. 3 (1983)
• Ferenc Gécseg, Balázs Imreh, On isomorphic representations of generalized definite automata , Acta Cybernetica: Vol. 15 No. 1 (2001)
• Ferenc Gécseg, Balázs Imreh, On αi-product of tree automata , Acta Cybernetica: Vol. 8 No. 2 (1987)
• Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi, On one-pass term rewriting , Acta Cybernetica: Vol. 14 No. 1 (1999)