On Pebble Automata for Data Languages with Decidable Emptiness Problem

Authors:
Tony Tan
Affiliations:
Department of Computer Science, Technion --- Israel Institute of Technology School of Informatics, University of Edinburgh,
Venue:
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Year:
2009

Citing 0
Cited 5

A Note on Two-pebble Automata Over Infinite Alphabets

Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
On pebble automata for data languages with decidable emptiness problem

Journal of Computer and System Sciences
Lossy counter machines decidability cheat sheet

RP'10 Proceedings of the 4th international conference on Reachability problems
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the satisfiability of two-variable logic over data words

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.