Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence |
scientific article |
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
