Combining Equational Tree Automata over AC and ACI Theories

DOI10.1007/978-3-540-70590-1_10zbMATH Open1155.68038OpenAlexW1523334341MaRDI QIDQ3522015FDOQ3522015

Joe Hendrix, Hitoshi Ohsaki

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/11428

Recommendations

• scientific article; zbMATH DE number 2090068
• scientific article; zbMATH DE number 2043529
• scientific article; zbMATH DE number 1841842
• On closure under complementation of equational tree automata for theories extending AC
• Tree automata help one to solve equational formulae in AC-theories

zbMATH Keywords

decidabilitytree automataterm rewritingequational theoriesmodular propertiestree languagesalternating tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Applications of universal algebra in computer science (08A70)

Cited In (6)

• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tree automata help one to solve equational formulae in AC-theories
• Title not available (Why is that?)

Uses Software

• Timbuk

This page was built for publication: Combining Equational Tree Automata over AC and ACI Theories

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