Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7173105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence |
scientific article; zbMATH DE number 7173105 |
Statements
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (English)
0 references
24 February 2020
0 references
pushdown automata
0 references
first-order grammars
0 references
bisimulation equivalence
0 references
regularity
0 references
0 references
0.994748830795288
0 references
0.8774177432060242
0 references
0.8450983762741089
0 references
0.824963390827179
0 references
0.8236506581306458
0 references
