Expressive Power of Pebble Automata

@inproceedings{Bojanczyk2006ExpressivePO,
  title={Expressive Power of Pebble Automata},
  author={Mikolaj Bojanczyk and Mathias Samuelides and Thomas Schwentick and Luc Segoufin},
  booktitle={ICALP},
  year={2006}
}
Two variants of pebble tree-walking automata on binary 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

Pebble Alternating Tree-Walking Automata and Their Recognizing Power

  • Acta Cybern.
  • 2008
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Tree-Walking Automata

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS

Pebble Weighted Automata and Weighted Logics

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Adding Pebbles to Weighted Automata

VIEW 1 EXCERPT
CITES METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Van Best . Trips on Trees

D. Suciu
  • In Acta Cybern .
  • 1999

Ullman Translations on a Context - Free Grammar

J. D. A. V. Aho
  • In Information and Control
  • 1971