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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Tan, T. (2009). On pebble automata for data languages with decidable emptiness problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 712–723). Springer Verlag. https://doi.org/10.1007/978-3-642-03816-7_60
Mendeley helps you to discover research relevant for your work.