On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of checking semantic equivalences between pushdown processes and finite-state processes |
scientific article |
Statements
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (English)
0 references
18 August 2010
0 references
pushdown automata
0 references
verification
0 references
simulation
0 references
bisimulation
0 references
0 references
