The equivalence problem for real-time deterministic pushdown automata (Q3028347): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The equivalence problem for real-time strict deterministic languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nested Stack Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank | |||
Normal rank | |||
Revision as of 11:14, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for real-time deterministic pushdown automata |
scientific article |
Statements
The equivalence problem for real-time deterministic pushdown automata (English)
0 references
1986
0 references
decidability of the algorithmic equivalence problem
0 references
