collaborators

1 paper

cs.FL2010

Transformations Between Different Types of Unranked Bottom-Up Tree Automata

Xiaoxue Piao, Kai Salomaa

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…