Automata-driven efficient subterm unification

DOI10.1016/S0304-3975(99)00131-0zbMath0972.68103MaRDI QIDQ5940920

No author found.

Publication date: 20 August 2001

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

zbMATH Keywords

string-matching automatasubterm unification algorithmsyntactic unification

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A note on mc-DFA and its minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Linear unification
• Variations on the Common Subexpression Problem
• Pattern Matching in Trees
• An Efficient Unification Algorithm
• Efficient string matching
• Efficiency of a Good But Not Linear Set Union Algorithm
• Nonlinear pattern matching in trees

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