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.
Get full access to this article
View all access options for this article.
You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/