scientific article; zbMATH DE number 749931

MaRDI QIDQ4764112zbMATH OpenFDO

Authors Dexter Kozen

Publication date 1 May 1995

zbMATH Keywords

term rewrite systempartial automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Algebraic Myhill-Nerode theorems
• On ground tree transformations and congruences induced by tree automata.
• A polynomial algorithm testing partial confluence of basic semi-Thue systems
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Tree automata for rewrite strategies

Cited in

(10)

• Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
• Intersection of finitely generated congruences over term algebra
• Complete sets of transformations for general E-unification
• The word and generator problems for lattices
• Congruential complements of ground term rewrite systems
• From Nerode's congruence to suffix automata with mismatches
• On ground tree transformations and congruences induced by tree automata.
• Unification theory
• Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata
• Rigid E-unification: NP-completeness and applications to equational matings

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 Q4764112)