Minimization of Deterministic Top-down Tree Automata

Zoltán Fülöp, Sándor Vágvölgyi · Acta Cybernetica · 2017

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.

Read the paper · More papers on PaperTik