Results 1  10
of
68
Antimirov and Mosses’s Rewrite System Revisited
, 2008
"... Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions. In this paper we present a functional approach to that method, prove its correctness, and give some experimental comparative results. Besides an improved version of Antimirov and Mosses ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions. In this paper we present a functional approach to that method, prove its correctness, and give some experimental comparative results. Besides an improved version of Antimirov
Rewriting Extended Regular Expressions
, 1993
"... We concider an extened 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 axiomatiztion ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
We concider an extened 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 axiomatiztion of the algebra and develop some termrewriting techniques for constructing logical inferences of valid equations. A shorter version of this paper is to appear in the proceedings of Developments in Language Theory, Univ. of Turku, July 1993, published by World Scientific. The present version has been submitted for publication elsewhere. 1 Introduction In this paper we consider an extended algebra of regular events (languages) on a given alphabet with intersection besides the usual operations (union, concatenation, Kleene star, empty, and the regular unit). This algebra has the structure of a distributive lattice (join is union, meet is intersection) with only monotonic operations. The latte...
Testing the Equivalence of Regular Languages
, 2009
"... The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algori ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear
Departamento de Ciência de Computadores Laboratório de Inteligência Artificial e Ciência de Computadores
, 2009
"... The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorit ..."
Abstract
 Add to MetaCart
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear
and
"... Bounds are given on the number of broken derived terms (a variant of Antimirov’s ‘partial derivatives’) of a rational expression E. It is shown that this number is less than or equal to 2ℓ(E) + 1 in the general case, where ℓ(E) is the literal length of the expression E, and that the classical bound ..."
Abstract
 Add to MetaCart
Bounds are given on the number of broken derived terms (a variant of Antimirov’s ‘partial derivatives’) of a rational expression E. It is shown that this number is less than or equal to 2ℓ(E) + 1 in the general case, where ℓ(E) is the literal length of the expression E, and that the classical bound
On the Number of Broken . . .
, 2009
"... Bounds are given on the number of broken derived terms (a variant of Antimirov’s ’partial derivatives’) of a rational expression E. It is shown that this number is less than or equal to 2l(E)+1 in the general case, where l(E) is the literal length of the expression E, and that the classical bound l ..."
Abstract
 Add to MetaCart
Bounds are given on the number of broken derived terms (a variant of Antimirov’s ’partial derivatives’) of a rational expression E. It is shown that this number is less than or equal to 2l(E)+1 in the general case, where l(E) is the literal length of the expression E, and that the classical bound
Theoretical Informatics and Applications Informatique Théorique et Applications Will be set by the publisher CORRIGENDUM TO OUR PAPER: HOW EXPRESSIONS CAN CODE FOR AUTOMATA
"... Abstract. In a previous paper, we have described the construction of an automaton from a rational expression which has the property that the automaton built from an expression which is itself computed from a codeterministic automaton by the state elimination method is codeterministic. It turned ou ..."
Abstract
 Add to MetaCart
an expression (Glushkov, Antimirov) output an automaton whose size is roughly (and at most for Antimirov) equal to the length of the expression. In a previous paper of ours [8], we have considered the possibility of finding a method that would be reversible, in the sense that
An Oxford Survey of Order Sorted Algebra
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 1994
"... ..."
Algebraic System Specification and Development: Survey and Annotated Bibliography  Second Edition 
, 1997
"... Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . ..."
Abstract
 Add to MetaCart
Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.2 Action Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.7 Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.1 Early Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.2 Recent Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . 55 4.7.3 The Common Framework Initiative. . . . . . . . . . . . . . . . . . . . . . . . . . . 56 5 Methodology 57 5.1 Development Phases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 5.1.1 Applica...
Results 1  10
of
68