The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757)
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: The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine |
scientific article; zbMATH DE number 3742628
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine |
scientific article; zbMATH DE number 3742628 |
Statements
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (English)
0 references
1981
0 references
deterministic pushdown automata
0 references
0 references
0 references
0 references
