Recognizing Regular Expressions by Means of Dataflow Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1996

Recognizing Regular Expressions by Means of Dataflow Networks

Pascal Raymond

Résumé

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.
Fichier principal
Vignette du fichier
reglo_icalp96.pdf (144.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00384443 , version 1 (16-05-2009)

Identifiants

  • HAL Id : hal-00384443 , version 1

Citer

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⟩
169 Consultations
257 Téléchargements

Partager

Gmail Facebook X LinkedIn More