On pebble automata for data languages with decidable emptiness problem

Journal of Computer and System Sciences

Volumn 76, Issue 8, 2010, Pages 778-791

  Tan, Tony ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Decidability; Finite state automata; Infinite alphabet

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FINITE AUTOMATA;

DATA VALUES; EMPTINESS PROBLEM; EQUALITY TESTS; FREEZE QUANTIFIERS; INFINITE ALPHABET; LINEAR TEMPORAL LOGIC; TOP VIEWS;

ROBOTS;

EID: 84865720175     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.03.004     Document Type: Article

References (17)

1. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena, A survey of regular model checking, in: Proceedings of the 15th International Conference on Concurrency Theory (CONCUR) 2004, in: Lecture Notes in Comput. Sci., vol. 3170, Springer, 2004, pp. 35-48.
2. Marcelo Arenas, Wenfei Fan, Leonid Libkin, Consistency of XML specifications, in: Inconsistency Tolerance [Dagstuhl Seminar], in: Lecture Notes in Comput. Sci., vol. 3300, Springer, 2005, pp. 15-41.
3. Henrik Björklund, Thomas Schwentick, On notions of regularity for data languages, in: Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT) 2007, in: Lecture Notes in Comput. Sci., vol. 4639, Springer, 2007, pp. 88-99.
4. Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David, Two-variable logic on words with data, in: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS) 2006, IEEE Computer Society, 2006, pp. 7-16.
5. Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin, Expressive power of pebble automata, in: Proceedings of Automata, Languages and Programming, 33rd International Colloquium (ICALP) 2006, in: Lecture Notes in Comput. Sci., vol. 4051, Springer, 2006, pp. 157-168.
6. Stéphane Demri, Ranko Lazic, LTL with the freeze quantifier and register automata, in: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS) 2006, IEEE Computer Society, 2006, pp. 17-26.
7. Allen Emerson, Kedar Namjoshi, Reasoning about rings, in: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) 1995, 1995, pp. 85-94.
8. John Hopcroft, Jeffrey Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
9. Michael Kaminski, Nissim Francez, Finite-memory automata, Theoret. Comput. Sci. 134 (2) (1994) 329-363.
10. Michael Kaminski, Tony Tan, A note on two-pebble automata over infinite alphabets, Fund. Inform. 98 (4) (2010) 379-390.
11. Richard Mayr, Undecidable problems in unreliable computations, Theoret. Comput. Sci. 297 (1-3) (2003) 337-354.
12. Frank Neven, Automata, logic, and XML, in: Proceedings of the 11th Annual Conference of the EACSL Computer Science Logic (CSL) 2002, in: Lecture Notes in Comput. Sci., vol. 2471, Springer, 2002, pp. 2-26.
13. Frank Neven, Thomas Schwentick, Victor Vianu, Finite state machines for strings over infinite alphabets, ACM Trans. Comput. Log. 5 (3) (2004) 403-435.
14. Philippe Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Inform. Process. Lett. 83 (5) (2002) 251-261.
15. Luc Segoufin, Automata and logics for words and trees over an infinite alphabet, in: Proceedings of the 15th Annual Conference of the EACSL Computer Science Logic (CSL) 2006, in: Lecture Notes in Comput. Sci., vol. 4207, Springer, 2006, pp. 41-57.
16. Tony Tan, Graph reachability and pebble automata over infinite alphabets, in: Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS) 2009, IEEE Computer Society, 2009, pp. 157-166.
17. Tony Tan, On pebble automata for data languages with decidable emptiness problem, in: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2009, in: Lecture Notes in Comput. Sci., vol. 5734, Springer, 2009, pp. 712-723.