6533b86ffe1ef96bd12cdb0a
RESEARCH PRODUCT
A decidable word problem without equivalent canonical term rewriting system
J. L. DeleageJean Marcel Pallosubject
Discrete mathematicsApplied MathematicsPost canonical systemComputer Science ApplicationsDecidabilityPhilosophy of languageComputational Theory and MathematicsConfluenceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONWord problem (mathematics)RewritingEquivalence (formal languages)Computer Science::Formal Languages and Automata TheoryAssociative propertyMathematicsdescription
We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1989-01-01 | International Journal of Computer Mathematics |