Recognizing Regular Expressions by Means of Dataflow Networks
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...