scholarly journals On Extended Regular Expressions

2009 ◽  
pp. 279-289 ◽  
Author(s):  
Benjamin Carle ◽  
Paliath Narendran
Keyword(s):  
Regular Expressions ◽  
Extended Regular Expressions

scholarly journals Extended regular expressions of star degree at most two

1990 ◽  
Vol 76 (2-3) ◽  
pp. 273-284 ◽  
Author(s):  
Kosaburo Hashiguchi ◽  
Heekeun Yoo
Keyword(s):  
Regular Expressions ◽  
Extended Regular Expressions

scholarly journals Rewriting extended regular expressions

1995 ◽  
Vol 143 (1) ◽  
pp. 51-72 ◽  
Author(s):  
Valentin M. Antimirov ◽  
Peter D. Mosses
Keyword(s):  
Regular Expressions ◽  
Extended Regular Expressions

scholarly journals Deterministic automata for extended regular expressions

2017 ◽  
Vol 7 (1) ◽  
pp. 24-28
Author(s):  
Mirzakhmet Syzdykov
Keyword(s):  
Finite Automaton ◽  
Regular Languages ◽  
Regular Expressions ◽  
Deterministic Finite Automaton ◽  
Past Work ◽  
The Past ◽  
Deterministic Automata ◽  
Extended Regular Expressions

Abstract In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

2009 ◽  
Vol 20 (04) ◽  
pp. 669-684 ◽  
Author(s):  
MARCO ALMEIDA ◽  
NELMA MOREIRA ◽  
ROGÉRIO REIS
Keyword(s):  
Finite Automata ◽  
Functional Approach ◽  
Regular Expressions ◽  
Average Case ◽  
Deterministic Finite Automata ◽  
Preliminary Results ◽  
Functional Version ◽  
Comparative Results ◽  
Rewrite System ◽  
Extended Regular Expressions

Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions. They argued that this method could lead to a better average-case algorithm than those based on the comparison of the equivalent minimal deterministic finite automata. In this paper we present a functional approach to that method, prove its correctness, and give some experimental comparative results. Besides an improved functional version of Antimirov and Mosses's algorithm, we present an alternative one using partial derivatives. Our preliminary results lead to the conclusion that, indeed, these methods are feasible and, most of the time, faster than the classical methods.

scholarly journals Rewriting Extended Regular Expressions

1993 ◽  
Vol 22 (461) ◽  
Author(s):  
Valentin M. Antimirov ◽  
Peter D. Mosses
Keyword(s):  
Distributive Lattice ◽  
Term Rewriting ◽  
Regular Expressions ◽  
Extended Regular Expressions

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.

scholarly journals Extended regular expressions of arbitrary star degrees

1992 ◽  
Vol 97 (2) ◽  
pp. 217-231
Author(s):  
Heekeun Yoo ◽  
Kosaburo Hashiguchi
Keyword(s):  
Regular Expressions ◽  
Extended Regular Expressions
Sign in / Sign up

Export Citation Format

Share Document