Automata-driven efficient subterm unification

DOI10.1016/S0304-3975(99)00131-0MaRDI QIDQ5940920zbMATH OpenFDO

Authors R. Ramesh, I. V. Ramakrishnan, R. Sekar

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00131-0

zbMATH Keywords

string-matching automatasubterm unification algorithmsyntactic unification

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the sequential nature of unification
• Unification and matching on compressed terms
• Adventures in associative-commutative unification
• A practically efficient and almost linear unification algorithm
• scientific article; zbMATH DE number 4049130

Cites work

• An Efficient Unification Algorithm
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficient string matching
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Linear unification
• Nonlinear pattern matching in trees
• Pattern Matching in Trees
• Variations on the Common Subexpression Problem

Cited in

(3)

• Solving a unification problem under constrained substitutions using tree automata
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
• A note on mc-DFA and its minimization

This page was built for publication: Automata-driven efficient subterm unification

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