scientific article; zbMATH DE number 512857

zbMath0795.68139MaRDI QIDQ4281554

J. L. Moysset, Denis Lugiez

Publication date: 18 July 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilitytree automataalgebraic specificationautomated theorem provingterm rewrite systemscomplement probleminductive reducibilityassociativity-commutativityinductionless induction proof method

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42)

Related Items

More problems in rewriting, Problems in rewriting III, The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable., Nominal equational problems, Unnamed Item, AC complement problems: Satisfiability and negation elimination, On the equivalence problem for letter-to-letter top-down tree transducers