Decidability of DPDA equivalence (Q5941060): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:49, 30 January 2024
scientific article; zbMATH DE number 1635225
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of DPDA equivalence |
scientific article; zbMATH DE number 1635225 |
Statements
Decidability of DPDA equivalence (English)
0 references
20 August 2001
0 references
A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.
0 references
DPDA
0 references
decidability
0 references
language equivalence
0 references
bisimulation
0 references
fundamental study
0 references
