Tree-Walking Automata Do Not Recognize All Regular Languages

Mikolaj Bojanczyk , Thomas Colcombet (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

Tree-walking automata are a natural sequential model for recognizing tree languages. It is well known that every tree language recognized by a tree-walking automaton is regular. We show that the converse does not hold.

Mots clés: tree automata; formal languages; tree-walking automata

Domaines: Logique en informatique [cs.LO]

Mikolaj Bojanczyk, Thomas Colcombet. Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM Journal on Computing, 2008, 38 (2), pp.658-701. ⟨10.1137/050645427⟩. ⟨hal-00347182⟩