Bisimulation equivalence of first-order grammars is ACKERMANN-complete (Q6654522)
From MaRDI portal
 | 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: Bisimulation equivalence of first-order grammars is ACKERMANN-complete |
scientific article; zbMATH DE number 7959729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bisimulation equivalence of first-order grammars is ACKERMANN-complete |
scientific article; zbMATH DE number 7959729 |
Statements
Bisimulation equivalence of first-order grammars is ACKERMANN-complete (English)
0 references
19 December 2024
0 references
bisimilarity
0 references
fast-growing complexity
0 references
first-order grammar
0 references
pushdown system
0 references
