The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403)
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: The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems |
scientific article; zbMATH DE number 64247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems |
scientific article; zbMATH DE number 64247 |
Statements
The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (English)
0 references
27 September 1992
0 references
confluence
0 references
finite special string-rewriting system
0 references
0 references
0 references
0.8857753276824951
0 references
0.8648965358734131
0 references
0.8449563384056091
0 references
0.8436741828918457
0 references
0.8327035307884216
0 references
