A decidable word problem without equivalent canonical term rewriting system

DOI10.1080/00207168908803729zbMath0665.03006OpenAlexW2112954333MaRDI QIDQ3816049

No author found.

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803729

zbMATH Keywords

efficient algorithmterm rewriting system

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)

Related Items (3)

Unnamed Item ⋮ Weak associativity and restricted rotation ⋮ Rational languages defined with a non-associative concatenation

Uses Software

• REVE

Cites Work

• A finite Thue system with decidable word problem and without equivalent finite canonical system
• A-transformation dans les arbres n-aires
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• Enumerating, Ranking and Unranking Binary Trees
• Word problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decidable word problem without equivalent canonical term rewriting system