Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772)
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: Finite canonical rewriting systems for congruences generated by concurrency relations |
scientific article; zbMATH DE number 4041311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite canonical rewriting systems for congruences generated by concurrency relations |
scientific article; zbMATH DE number 4041311 |
Statements
Finite canonical rewriting systems for congruences generated by concurrency relations (English)
0 references
1987
0 references
decidabilty
0 references
concurrency relation
0 references
alphabet
0 references
free partially commutative monoid
0 references
finite canonical rewriting system
0 references
polynomial time
0 references
0 references
0.9122696
0 references
0.89589155
0 references
0.88860285
0 references
0.8877295
0 references
0 references
0.8860095
0 references
0.8853823
0 references
0.8845497
0 references
