Minimization of deterministic top-down tree automata

Zoltán Fülöp; Sándor Vágvölgyi

doi:10.14232/actacyb.23.1.2017.21

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

Minimization of deterministic top-down tree automata

Zoltán Fülöp
Sándor Vágvölgyi

DOI: https://doi.org/10.14232/actacyb.23.1.2017.21

Abstract

We consider offline sensing unranked top-down tree automata in which the state transitions are computed by bimachines. We give a polynomial time algorithm for minimizing such tree automata when they are state-separated.

Downloads

Download data is not yet available.

PDF

Published

2017-01-01

How to Cite

Fülöp, Z., & Vágvölgyi, S. (2017). Minimization of deterministic top-down tree automata. Acta Cybernetica, 23(1), 379-401. https://doi.org/10.14232/actacyb.23.1.2017.21

Download Citation

Issue

Vol 23 No 1 (2017)

Section

Regular articles

Most read articles by the same author(s)

Zoltán Fülöp, On attributed tree transducers , Acta Cybernetica: Vol 5 No 3 (1981)
Zoltán Fülöp, Decomposition results concerning K-visit attributed tree transducers , Acta Cybernetica: Vol 6 No 2 (1983)
Sándor Vágvölgyi, On compositions of root-to-frontier tree transformations , Acta Cybernetica: Vol 7 No 4 (1986)
Zoltán Fülöp, Sándor Vágvölgyi, Results on compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 1 (1987)
Sándor Vágvölgyi, Zoltán Fülöp, An infinite hierarchy of tree transformations in the class NDR , Acta Cybernetica: Vol 8 No 2 (1987)
Zoltán Fülöp, Sándor Vágvölgyi, On ranges of compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 3 (1988)
Sándor Vágvölgyi, [Könyvismertetés] , Acta Cybernetica: Vol 8 No 3 (1988)
Zoltán Fülöp, István Babcsányi, Attila Nagy, Correction : Mealy-automata in which the output-equivalence is a congruence : I. Babcsányi, A. Nagy , Acta Cybernetica: Vol 12 No 1 (1995)
Zoltán Fülöp, Correction : Invariance groups of threshold functions : E. K. Horváth , Acta Cybernetica: Vol 12 No 1 (1995)
Zoltán Fülöp, On one-pass term rewriting , Acta Cybernetica: Vol 14 No 1 (1999)

1 2 3 > >>