A Note on Two-pebble Automata Over Infinite Alphabets.
Journal
Fundam. Inform.
Journal Volume
98
Journal Issue
4
Pages
379-390
Date Issued
2010
Author(s)
Kaminski, Michael
TONY TAN
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.
SDGs
Type
journal article