Expressive power of pebbles Automata

Mikolaj Bojanczyk (1, 2) , Mathias Samuelides (1, 3) , Thomas Schwentick (4) , Luc Segoufin (3)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 Institute of Informatics [Warsaw]
3 GEMO - Integration of data and knowledge distributed over the web
4 Lehrstuhl Informatik 1 [Dortmund]

Two variants of pebble tree-walking automata on trees are considered that were introduced in the literature. It is shown that for each number of pebbles, the two models have the same expressive power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp. deterministic) tree-walking automata with n + 1 pebbles can recognize more languages than those with n pebbles. Moreover, there is a regular tree language that is not recognized by any tree- walking automaton with pebbles. As a consequence, FO+posTC is strictly included in MSO over trees.

Domaines: Informatique et langage [cs.CL]

Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin. Expressive power of pebbles Automata. Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, 2006, Venice, Italy. pp.157-168. ⟨hal-00158631⟩