Perfect bases for equational theories

DOI10.1006/JSCO.1995.1028zbMath0838.68065OpenAlexW1967103832MaRDI QIDQ1904140

George F. McNulty, Jaroslav Jezek

Publication date: 27 May 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3a10e2aff7c64c85bee2cbc7f475f3be35bedf01

zbMATH Keywords

perfect basesterm rewrite systems

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Grammars and rewriting systems (68Q42)

Related Items (1)

Some decidable congruences of free monoids

This page was built for publication: Perfect bases for equational theories