Pascal Raymond  Home/Search
Context Related
| verimag.imag.fr/~r...eglo:icalp96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: verimag.imag.fr/~...reglo:icalp96 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. Introduction "Grep" machine: Let \Sigma be a vocabulary, L be a regular language on \Sigma . A "grep" machine is a machine receiving a sequence s 0 ; s 1 ; : : : ; s n ; : : : of symbols (s i ... (Update)
Similar documents based on text: More All
0.2: Recognizing Regular Expressions by means of Dataflow Networks.. - Raymond (1995) (Correct)
0.2: Application Experience with an Implicitly Parallel.. - Jagannathan, Dodd (1994) (Correct)
0.1: Gradient-based Reinforcement Planning in Policy-Search.. - Kwee, Hutter, Schmidhuber (2001) (Correct)
BibTeX entry: (Update)
P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996. http://citeseer.ist.psu.edu/raymond96recognizing.html More
@inproceedings{ raymond96recognizing,
author = "Pascal Raymond",
title = "Recognizing Regular Expressions by Means of Dataflow Networks",
booktitle = "Automata, Languages and Programming",
pages = "336-347",
year = "1996",
url = "citeseer.ist.psu.edu/raymond96recognizing.html" }
Citations (may not include all citations):270 Synchronous programming of reactive systems (context) - Halbwachs - 1993
82 Algorithms for finding patterns in strings (context) - Aho - 1990
66 Derivatives of regular expressions (context) - Brzozowski - 1964
64 From regular expressions to deterministic automata (context) - Berry, Sethi - 1986
57 Regular expression search algorithm (context) - Thompson
44 Synchronous observers and the verification of reactive syste.. - Halbwachs, Lagnier et al. - 1993
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
33 Regular expressions and state graphs for automata (context) - McNaughton, Yamada - 1960
12 From regular expressions to DFA's using compressed NFA's - Chang, Paige - 1992
8 Partial derivatives of regular expressions and finite automa.. - Antimirov - 1995
4 The compilation of regular expressions into integrated circu.. (context) - Floyd, Ullman - 1982
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC