The equivalence problem for deterministic pushdown automata is decidable (Q4571996): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57381972, #quickstatements; #temporary_batch_1705957399925 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57381972 / rank | |||
Normal rank | |||
Revision as of 23:28, 22 January 2024
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
