The equivalence problem for real-time deterministic pushdown automata (Q3028347): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01074776 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969807610 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:10, 30 July 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
