On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552)
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: On the complexity of checking semantic equivalences between pushdown processes and finite-state processes |
scientific article; zbMATH DE number 5772400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of checking semantic equivalences between pushdown processes and finite-state processes |
scientific article; zbMATH DE number 5772400 |
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
0 references
0.8653071522712708
0 references
0.8183475136756897
0 references
