Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731): Difference between revisions
From MaRDI portal
Latest revision as of 17:29, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weak bisimilarity and regularity of context-free processes is EXPTIME-hard |
scientific article |
Statements
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (English)
0 references
22 February 2005
0 references
Context-free processes
0 references
BPA
0 references
Pushdown automata
0 references
Bisimulation
0 references
0 references