On pebble automata for data languages with decidable emptiness problem (Q1959427)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On pebble automata for data languages with decidable emptiness problem |
scientific article; zbMATH DE number 5796731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On pebble automata for data languages with decidable emptiness problem |
scientific article; zbMATH DE number 5796731 |
Statements
On pebble automata for data languages with decidable emptiness problem (English)
0 references
7 October 2010
0 references
finite state automata
0 references
infinite alphabet
0 references
decidability
0 references
2-pebble automata
0 references
3-pebble automata
0 references
