Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2995466559 / rank | |||
Normal rank | |||
Revision as of 14:35, 19 March 2024
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
