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
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
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even lengtha0 b0 ... an b_n over an infinite alphabet as a directed graph with the symbols that appear in a0 b0 ... an bn as the vertices and (a0, b0),...,(an, bn) as the edges. We prove that for any positive integer k, k pebbles are sufficient for recognizing the existence of a path of length 2^k-1 from the vertex a0 to the vertex bn, but are not sufficient for recognizing the existence of a path of length 2^{k+1} - 2 from the vertex a0 to the vertex bn. Based on this result, we establish a number of relations among some classes of languages over infinite alphabets.