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.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/