The following pages link to Complexity of matching problems (Q1099615):
Displayed 9 items.
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Unnecessary inferences in associative-commutative completion procedures (Q3489486) (← links)
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Q5504662) (← links)