A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577)
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: A generic framework for checking semantic equivalences between pushdown automata and finite-state automata |
scientific article; zbMATH DE number 6789954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generic framework for checking semantic equivalences between pushdown automata and finite-state automata |
scientific article; zbMATH DE number 6789954 |
Statements
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (English)
0 references
11 October 2017
0 references
pushdown automata
0 references
semantic equivalences
0 references
bisimulation
0 references
0 references
0 references
0 references
0 references
0.9290889
0 references
0.90237635
0 references
0.8875705
0 references
0.88723344
0 references
0.88313097
0 references
0.87718344
0 references
0.8761844
0 references
