Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:48, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synchronizable deterministic pushdown automata and the decidability of their equivalence |
scientific article |
Statements
Synchronizable deterministic pushdown automata and the decidability of their equivalence (English)
0 references
1986
0 references
The authors introduce the concept of synchronized pushdown automaton and prove that the equivalence problem for these machines is decidable.
0 references
decidability of equivalence
0 references
synchronized pushdown automaton
0 references
equivalence problem
0 references
