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, Representation of automaton mappings in finite length , Acta Cybernetica: Vol 2 No 4 (1976)
Ferenc Gécseg, On a representation of deterministic uniform root-to-frontier tree transformations , Acta Cybernetica: Vol 6 No 2 (1983)
Zoltán Ésik, Ferenc Gécseg, General products and equational classes of automata , Acta Cybernetica: Vol 6 No 3 (1983)
Ferenc Gécseg, On v1-products of commutative automata , Acta Cybernetica: Vol 7 No 1 (1985)
Ferenc Gécseg, Metric representations by vi-products , Acta Cybernetica: Vol 7 No 2 (1985)
Ferenc Gécseg, Balázs Imreh, On metric equivalence of vi-products , Acta Cybernetica: Vol 8 No 2 (1987)
Ferenc Gécseg, Balázs Imreh, On αi-product of tree automata , Acta Cybernetica: Vol 8 No 2 (1987)
Ferenc Gécseg, Balázs Imreh, On star-products of automata , Acta Cybernetica: Vol 9 No 2 (1989)
Balázs Imreh, Magnus Steinby, Some remarks on directable automata , Acta Cybernetica: Vol 12 No 1 (1995)
Balázs Imreh, Magnus Steinby, Directable nondeterministic automata , Acta Cybernetica: Vol 14 No 1 (1999)

1 2 > >>