scientific article; zbMATH DE number 512857

MaRDI QIDQ4281554zbMATH OpenFDO

Authors J. L. Moysset, D. Lugiez

Publication date 18 July 1994

zbMATH Keywords

algebraic specificationassociativity-commutativityautomated theorem provingcomplement problemdecidabilityinductionless induction proof methodinductive reducibilityterm rewrite systemstree automata

Mathematics Subject Classification ID

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

Recommendations

• Tree automata help one to solve equational formulae in AC-theories
• scientific article; zbMATH DE number 1346499
• scientific article; zbMATH DE number 176149

Cited in

(17)

• On the equivalence problem for letter-to-letter top-down tree transducers
• The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
• The complexity of some complementation problems
• Tree automata help one to solve equational formulae in AC-theories
• Nominal equational problems
• Rewriting in the partial algebra of typed terms modulo AC
• scientific article; zbMATH DE number 4164133 (Why is no real title available?)
• scientific article; zbMATH DE number 176756 (Why is no real title available?)
• scientific article; zbMATH DE number 2043529 (Why is no real title available?)
• Complete sets of reductions modulo associativity, commutativity and identity
• AC complement problems: Satisfiability and negation elimination
• More problems in rewriting
• Problems in rewriting III
• AC complement problems: Satisfiability and negation elimination
• Complete axiomatizations of some quotient term algebras
• Anti-pattern templates
• A nominal approach to equational problems in languages with binders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281554)