 |
|
|
|
| HAL: hal-00384443, version 1 |
| Detailed view |  Export this paper |
|
|
| Automata, Languages and Programming, 23rd International Colloquium (ICALP'96), Paderborn : Allemagne (1996) |
|
|
|
|
| Recognizing Regular Expressions by Means of Dataflow Networks |
|
|
| Pascal Raymond 1 |
|
|
| (1996) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computation and Language |
|
|
| Regular Expression – Dataflow Network – Sequential Circuit – Finite Automata |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00384443, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00384443 | |
| oai:hal.archives-ouvertes.fr:hal-00384443 | |
| From: Pascal Raymond | |
| Submitted on: Saturday, 16 May 2009 12:59:10 | |
| Updated on: Monday, 18 May 2009 08:53:45 | |
