A Note on Two-pebble Automata Over Infinite Alphabets

Authors:
Michael Kaminski;Tony Tan
Affiliations:
Department of Computer Science, Technion - Israel Institute of Technology Haifa 32000, Israel. E-mail: kaminski@cs.technion.ac.il;Department of Computer Science, Technion - Israel Institute of Technology Haifa 32000, Israel. E-mail: kaminski@cs.technion.ac.il
Venue:
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Year:
2010

Citing 7
Cited 1

Hilbert's tenth problem

Hilbert's tenth problem
Finite-memory automata

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Automata, Logic, and XML

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic (TOCL)
Graph Reachability and Pebble Automata over Infinite Alphabets

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
On Pebble Automata for Data Languages with Decidable Emptiness Problem

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009

On pebble automata for data languages with decidable emptiness problem

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the emptiness problemfor two-pebble automata languages is undecidable and that two-pebble automata are weaker than three-pebble automata.