Minimization of deterministic top-down tree automata
AbstractWe 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.
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