Regular expression order-sorted unification and matching
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- An efficient null-free procedure for deciding regular language membership
- An Efficient Unification Algorithm
- An Oxford survey of order sorted algebra
- Closure of Hedge-Automata Languages by Hedge Rewriting
- Complexity of generalized satisfiability counting problems
- Computational aspects of an order-sorted logic with term declarations
- Equational formulae with membership constraints
- Formal modeling: actors, open systems, biological systems. Essays dedicated to Carolyn Talcott on the occasion of her 70th birthday
- scientific article; zbMATH DE number 1722705 (Why is no real title available?)
- scientific article; zbMATH DE number 4049131 (Why is no real title available?)
- scientific article; zbMATH DE number 4056995 (Why is no real title available?)
- scientific article; zbMATH DE number 51893 (Why is no real title available?)
- scientific article; zbMATH DE number 1348460 (Why is no real title available?)
- scientific article; zbMATH DE number 2090055 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Inductive proofs by specification transformations
- Makanin's algorithm for word equations-two improvements and a generalization
- Matching with Regular Constraints
- On the relation between context and sequence unification
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Order-sorted equational unification revisited
- Order-sorted unification
- Partial derivatives of regular expressions and finite automaton constructions
- Programming Techniques: Regular expression search algorithm
- Regular expression order-sorted unification and matching
- Regular expression pattern matching for XML
- Rewriting regular inequalities
- Sequence Unification Through Currying
- Solving equations with sequence variables and sequence functions
- Succinctness of the Complement and Intersection of Regular Expressions
- The complexity of computing the permanent
- The complexity of counting problems in equational matching
- The Complexity of Enumeration and Reliability Problems
- The complexity of satisfiability problems
- The number of proof lines and the size of proofs in first order logic
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Unification in sort theories and its applications
- Unification theory
Cited in
(5)- Variadic equational matching in associative and commutative theories
- Inferring deterministic regular expression with unorder
- scientific article; zbMATH DE number 176147 (Why is no real title available?)
- Order-Sorted Unification with Regular Expression Sorts.
- Regular expression order-sorted unification and matching
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)
