Trace rewriting: Computing normal forms in time O(n log n) (Q4593937)
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: Trace rewriting: Computing normal forms in time O(n log n) |
scientific article; zbMATH DE number 6807561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trace rewriting: Computing normal forms in time O(n log n) |
scientific article; zbMATH DE number 6807561 |
Statements
Trace rewriting: Computing normal forms in time O(n log n) (English)
0 references
16 November 2017
0 references
Mazurkiewicz traces
0 references
rewriting modulo a partial commutation
0 references
0.86485744
0 references
0.8596947
0 references
0.83815396
0 references
0.8344366
0 references
0.83057487
0 references
0.82980657
0 references
0.82801616
0 references
