Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Xiaoxue Piao, Kai Salomaa · Fundamenta Informaticae · 2011
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal strin