Another variation on the common subexpression problem

DOI10.1016/0012-365X(93)90379-8zbMath0787.68071MaRDI QIDQ685700

Andreas Podelski, Maurice Nivat

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel complexitytree automataNerode equivalencecommon subexpression problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• An algebraic semantics approach to the effective resolution of type equations
• On the relationship of congruence closure and unification
• Deciding Equivalence of Finite Tree Automata
• On the sequential nature of unification
• Fast Decision Procedures Based on Congruence Closure
• Variations on the Common Subexpression Problem
• Efficiency of a Good But Not Linear Set Union Algorithm
• Generalized finite automata theory with an application to a decision problem of second-order logic
• The minimalization of tree automata

This page was built for publication: Another variation on the common subexpression problem