Tightening the complexity of equivalence problems for commutative grammars (Q4601893)
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: Tightening the complexity of equivalence problems for commutative grammars |
scientific article; zbMATH DE number 6829382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tightening the complexity of equivalence problems for commutative grammars |
scientific article; zbMATH DE number 6829382 |
Statements
24 January 2018
0 references
language equivalence
0 references
commutative grammars
0 references
Presburger arithmetic
0 references
semi-linear sets
0 references
Petri nets
0 references
0.8681437969207764
0 references
0.8634310960769653
0 references
0.8141804933547974
0 references
0.8065588474273682
0 references
0.7880424857139587
0 references
