Regular expression order-sorted unification and matching (Q741252)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Regular expression order-sorted unification and matching	scientific article

Statements

scholarly article

Regular expression order-sorted unification and matching (English)

Journal of Symbolic Computation

publication date

11 September 2014

zbMATH Keywords

unification

matching

ordered sorts

regular expressions

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.jsc.2014.08.002

Rewriting regular inequalities

Partial derivatives of regular expressions and finite automaton constructions

Inductive proofs by specification transformations

Equational formulae with membership constraints

Complexity of generalized satisfiability counting problems

Formal modeling: actors, open systems, biological systems. Essays dedicated to Carolyn Talcott on the occasion of her 70th birthday

Succinctness of the Complement and Intersection of Regular Expressions

An Oxford survey of order sorted algebra

Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations

Order-sorted Equational Unification Revisited

The complexity of counting problems in equational matching

Regular expression pattern matching for XML

Closure of Hedge-Automata Languages by Hedge Rewriting

The number of proof lines and the size of proofs in first order logic

Solving equations with sequence variables and sequence functions

Sequence Unification Through Currying

On the relation between context and sequence unification

Matching with Regular Constraints

Regular expression order-sorted unification and matching

THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP

An Efficient Unification Algorithm

Order-sorted unification

An efficient null-free procedure for deciding regular language membership

A Machine-Oriented Logic Based on the Resolution Principle

The complexity of satisfiability problems

Computational aspects of an order-sorted logic with term declarations

Makanin's algorithm for word equations-two improvements and a generalization

Programming Techniques: Regular expression search algorithm

The complexity of computing the permanent

The Complexity of Enumeration and Reliability Problems

Unification in sort theories and its applications

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:741252

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q741252&oldid=35411124"