The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems |
scientific article |
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