Regular expression order-sorted unification and matching
DOI10.1016/J.JSC.2014.08.002zbMATH Open1456.68073OpenAlexW2048509141WikidataQ41046736 ScholiaQ41046736MaRDI QIDQ741252FDOQ741252
Authors: Temur Kutsia, Mircea Marin
Publication date: 11 September 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.08.002
Recommendations
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42)
Cites Work
- The complexity of computing the permanent
- Partial derivatives of regular expressions and finite automaton constructions
- Unification theory
- Succinctness of the Complement and Intersection of Regular Expressions
- The Complexity of Enumeration and Reliability Problems
- The complexity of satisfiability problems
- Title not available (Why is that?)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Title not available (Why is that?)
- Complexity of generalized satisfiability counting problems
- An Efficient Unification Algorithm
- A Machine-Oriented Logic Based on the Resolution Principle
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- An efficient null-free procedure for deciding regular language membership
- The number of proof lines and the size of proofs in first order logic
- Makanin's algorithm for word equations-two improvements and a generalization
- An Oxford survey of order sorted algebra
- Formal modeling: actors, open systems, biological systems. Essays dedicated to Carolyn Talcott on the occasion of her 70th birthday
- Programming Techniques: Regular expression search algorithm
- Unification in sort theories and its applications
- Computational aspects of an order-sorted logic with term declarations
- Title not available (Why is that?)
- Order-sorted equational unification revisited
- Order-sorted unification
- Inductive proofs by specification transformations
- Rewriting regular inequalities
- On the relation between context and sequence unification
- Equational formulae with membership constraints
- The complexity of counting problems in equational matching
- Solving equations with sequence variables and sequence functions
- Title not available (Why is that?)
- Regular expression pattern matching for XML
- Closure of Hedge-Automata Languages by Hedge Rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching with Regular Constraints
- Sequence Unification Through Currying
- Regular expression order-sorted unification and matching
Cited In (5)
Uses Software
This page was built for publication: Regular expression order-sorted unification and matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741252)