Sciweavers

MFCS
2009
Springer

On Pebble Automata for Data Languages with Decidable Emptiness Problem

14 years 6 months ago
On Pebble Automata for Data Languages with Decidable Emptiness Problem
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is still decidable.
Tony Tan
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where MFCS
Authors Tony Tan
Comments (0)