The equivalence problem for deterministic pushdown automata is decidable (Q4571996): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57381972 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/3-540-63165-8_221 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1518704718 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 23:53, 19 March 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