The equivalence problem for deterministic pushdown automata is decidable (Q4571996)
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 deterministic pushdown automata is decidable |
scientific article; zbMATH DE number 6898419
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for deterministic pushdown automata is decidable |
scientific article; zbMATH DE number 6898419 |
Statements
The equivalence problem for deterministic pushdown automata is decidable (English)
0 references
4 July 2018
0 references
0 references
