Regular expression order-sorted unification and matching
From MaRDI portal
Publication:741252
DOI10.1016/j.jsc.2014.08.002zbMath1456.68073OpenAlexW2048509141WikidataQ41046736 ScholiaQ41046736MaRDI QIDQ741252
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
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Variadic equational matching in associative and commutative theories ⋮ Regular expression order-sorted unification and matching
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-sorted unification
- The complexity of computing the permanent
- Formal modeling: actors, open systems, biological systems. Essays dedicated to Carolyn Talcott on the occasion of her 70th birthday
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expression order-sorted unification and matching
- On the relation between context and sequence unification
- The number of proof lines and the size of proofs in first order logic
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Equational formulae with membership constraints
- Unification in sort theories and its applications
- An efficient null-free procedure for deciding regular language membership
- Computational aspects of an order-sorted logic with term declarations
- The complexity of counting problems in equational matching
- Complexity of generalized satisfiability counting problems
- Solving equations with sequence variables and sequence functions
- Succinctness of the Complement and Intersection of Regular Expressions
- Regular expression pattern matching for XML
- Closure of Hedge-Automata Languages by Hedge Rewriting
- The Complexity of Enumeration and Reliability Problems
- An Efficient Unification Algorithm
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- An Oxford survey of order sorted algebra
- Inductive proofs by specification transformations
- Rewriting regular inequalities
- Order-sorted Equational Unification Revisited
- Matching with Regular Constraints
- The complexity of satisfiability problems
- Sequence Unification Through Currying
- A Machine-Oriented Logic Based on the Resolution Principle
- Programming Techniques: Regular expression search algorithm
- Makanin's algorithm for word equations-two improvements and a generalization
