ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES (Q4286116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 540227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES |
scientific article; zbMATH DE number 540227 |
Statements
ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES (English)
0 references
27 April 1994
0 references
pushdown automata
0 references
counter machines
0 references
reversal-bounded
0 references
emptiness
0 references
0.997763454914093
0 references
0.8922858238220215
0 references
0.8811672925949097
0 references
0.8808128237724304
0 references
