Skip to Main content Skip to Navigation
Conference papers

Recognizing Regular Expressions by Means of Dataflow Networks

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00384443
Contributor : Pascal Raymond <>
Submitted on : Saturday, May 16, 2009 - 12:59:10 PM
Last modification on : Thursday, November 19, 2020 - 3:58:02 PM
Long-term archiving on: : Monday, October 15, 2012 - 10:30:31 AM

File

reglo_icalp96.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00384443, version 1

Collections

Citation

Pascal Raymond. Recognizing Regular Expressions by Means of Dataflow Networks. Automata, Languages and Programming, 23rd International Colloquium (ICALP'96), 1996, Paderborn, Germany. pp.336--347. ⟨hal-00384443⟩

Share

Metrics

Record views

378

Files downloads

500