## Recognizing Regular Expressions by means of Dataflow Networks (1996)

Venue: | In proc. of the 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96 |

Citations: | 18 - 3 self |

### BibTeX

@INPROCEEDINGS{Raymond96recognizingregular,

author = {Pascal Raymond},

title = {Recognizing Regular Expressions by means of Dataflow Networks},

booktitle = {In proc. of the 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96},

year = {1996},

pages = {336--347},

publisher = {Springer Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. This paper addresses the problem of building a Boolean dataflow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression. Introduction "Grep" machine: Let \Sigma be a vocabulary, L be a regular language on \Sigma . A "grep" machine is a machine receiving a sequence s 0 ; s 1 ; : : : ; s n ; : : : of symbols (s i 2 \Sigma ) and computing a sequence b 0 ; b 1 ; : : : ; b n ; : : : of Booleans, such that b n is true if and only if the word s 0 s 1 : : : s n belongs to L 2 . This paper addresses the problem of building a "grep" machine for languages described by regular expressions. This problem is rather classical [4, 11, 10, 3, 1, 2]. We propose a solution which, to our knowledge, is new: Informally, it consists of building, from a regular expression E, a "circuit" (or Boolean data-flow network) explori...

### Citations

436 | Synchronous programming of reactive systems
- Halbwachs
- 1993
(Show Context)
Citation Context ...n 2 (true fby y) and a b a + 2 or 2 rec z = 2 or x \Delta Fig. 2. The network of (a + b) \Delta a 7 Implementation and use The origin of this work takes place in the domain of synchronous programming =-=[8]-=-. Synchronous programming offers an idealized framework for programming reactive systems. For instance, idealized sequential circuits are synchronous programs. This idealized framework also permits to... |

225 | Derivatives of regular expressions
- Brzozowski
- 1964
(Show Context)
Citation Context ... and only if the word s 0 s 1 : : : s n belongs to L 2 . This paper addresses the problem of building a "grep" machine for languages described by regular expressions. This problem is rather =-=classical [4, 11, 10, 3, 1, 2]. We propo-=-se a solution which, to our knowledge, is new: Informally, it consists of building, from a regular expression E, a "circuit" (or Boolean data-flow network) exploring all the branches of a no... |

127 |
Algorithms for Finding Patterns in Strings
- Aho
- 1990
(Show Context)
Citation Context ... and only if the word s 0 s 1 : : : s n belongs to L 2 . This paper addresses the problem of building a "grep" machine for languages described by regular expressions. This problem is rather =-=classical [4, 11, 10, 3, 1, 2]. We propo-=-se a solution which, to our knowledge, is new: Informally, it consists of building, from a regular expression E, a "circuit" (or Boolean data-flow network) exploring all the branches of a no... |

127 |
Regular expression search algorithm
- Thompson
- 1968
(Show Context)
Citation Context ... and only if the word s 0 s 1 : : : s n belongs to L 2 . This paper addresses the problem of building a "grep" machine for languages described by regular expressions. This problem is rather =-=classical [4, 11, 10, 3, 1, 2]. We propo-=-se a solution which, to our knowledge, is new: Informally, it consists of building, from a regular expression E, a "circuit" (or Boolean data-flow network) exploring all the branches of a no... |

108 | Synchronous observers and the verification of reactive systems
- Halbwachs, Lagnier, et al.
- 1993
(Show Context)
Citation Context ...re synchronous programs. This idealized framework also permits to perform formal verifications on programs. Critical properties are described by means of Boolean synchronous programs called observers =-=[9]-=-. Such observers can be expressed with any existing synchronous language (Lustre, Argos, Esterel), but it appears that the classical regular constructs (sequence, iteration) are also very useful to de... |

101 |
From regular expressions to deterministic automata
- Berry, Sethi
- 1986
(Show Context)
Citation Context |

101 |
Regular expressions and state graphs for automata
- MacNaughton, Yamada
- 1960
(Show Context)
Citation Context |

63 | Partial derivatives of regular expressions and finite automaton constructions
- Antimirov
- 1996
(Show Context)
Citation Context |

40 |
On Equations for Regular Languages, Finite Automata
- Brzozowski, Leiss
- 1980
(Show Context)
Citation Context ..."circuit" (or Boolean data-flow network) exploring all the branches of a non-deterministic automaton recognizingsL(E). The relations between regular languages and sequential circuits are als=-=o studied [5, 7]-=-. But the important point here, is that the automaton is never explicit (it is represented implicitly by a system of Boolean equations) nor deterministic. As a consequence, both the construction time ... |

38 |
The Compilation of Regular Expressions into Integrated Circuits
- Floyd, Ullman
- 1982
(Show Context)
Citation Context ..."circuit" (or Boolean data-flow network) exploring all the branches of a non-deterministic automaton recognizingsL(E). The relations between regular languages and sequential circuits are als=-=o studied [5, 7]-=-. But the important point here, is that the automaton is never explicit (it is represented implicitly by a system of Boolean equations) nor deterministic. As a consequence, both the construction time ... |

34 | From regular expressions to DFAs using compressed NFAs
- Chang, Paige
- 1992
(Show Context)
Citation Context ... t n ", where each t i is a language term of a "special" form. The various known methods for building grep machines can be related to the form of the terms. This classification is large=-=ly inspired by [5, 6]-=-. In this paper, we use the following notations: let ` be a system of equations, we note V(`) the set of language identifiers defined in `, A(`) 2 V(`) the main language (the axiom), and for each X 2 ... |