Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synchronizable deterministic pushdown automata and the decidability of their equivalence |
scientific article; zbMATH DE number 4001512
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synchronizable deterministic pushdown automata and the decidability of their equivalence |
scientific article; zbMATH DE number 4001512 |
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
0 references
0 references
0 references
0 references
