Recognizing Regular Expressions by Means of Dataflow Networks

Pascal Raymond (1)

1 VERIMAG - IMAG - VERIMAG

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.

Keywords: Regular Expression; Dataflow Network; Sequential Circuit; Finite Automata

Domains: Computation and Language [cs.CL]

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⟩