A Note on Two-pebble Automata Over Infinite Alphabets
From MaRDI portal
Publication:3561220
DOI10.3233/FI-2010-234zbMath1200.03026MaRDI QIDQ3561220
Publication date: 25 May 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (2)
On Pebble Automata for Data Languages with Decidable Emptiness Problem ⋮ On pebble automata for data languages with decidable emptiness problem
This page was built for publication: A Note on Two-pebble Automata Over Infinite Alphabets