We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations
This paper presents a new algorithm for the containment problem for extended regular expressions tha...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
We concider an extened algebra of regular events (languages) with intersection besides the usual ope...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
Salomaa ((1969) Theory of Automata, page 143) asked whether the equational theory of regular express...
The study of regular expressions, possibly extended with operators other than the usual union, conca...
The use of derivatives for efficiently deciding equivalence and membership in regular languages has ...
We propose regular expressions to abstractly model and study properties of resource-aware computatio...
AbstractSalomaa (1969, p. 143) asked whether the equational theory of regular expressions over a sin...
We propose regular expressions to abstractly model and study properties of resource-aware computatio...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
This paper presents a new algorithm for the containment problem for extended regular expressions tha...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
We concider an extened algebra of regular events (languages) with intersection besides the usual ope...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
Salomaa ((1969) Theory of Automata, page 143) asked whether the equational theory of regular express...
The study of regular expressions, possibly extended with operators other than the usual union, conca...
The use of derivatives for efficiently deciding equivalence and membership in regular languages has ...
We propose regular expressions to abstractly model and study properties of resource-aware computatio...
AbstractSalomaa (1969, p. 143) asked whether the equational theory of regular expressions over a sin...
We propose regular expressions to abstractly model and study properties of resource-aware computatio...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
This paper presents a new algorithm for the containment problem for extended regular expressions tha...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...