Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. (Q4608615)
From MaRDI portal
| File:Ambox important.svg | 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: Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. |
scientific article; zbMATH DE number 6851885
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. |
scientific article; zbMATH DE number 6851885 |
Statements
21 March 2018
0 references
pushdown processes
0 references
first-order grammars
0 references
bisimulation
0 references
regularity
0 references
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. (English)
0 references
1.0000002
0 references
0.90265185
0 references
0.90265185
0 references
0 references
0.89191854
0 references
0.8816643
0 references
0.8800319
0 references
0.87528527
0 references
