See this document in CiteSeerX!

Linear Encoding Scheme for Weighted Finite Automata (2005)  (Make Corrections)  (1 citation)
Mathieu Giraud, Dominique Lavenier



  Home/Search   Context   Related

 
View or download:
lifl.fr/~giraud/pu...a04lncs3317.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  www2.lifl.fr/~g...ibmagiraud_bib (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we show that the linear encoding scheme e#- ciently implements weighted finite automata (WFA). WFA with t transitions can be hardwired with O(t) cells. They solve pattern matching problems in a pipelined way, parsing one character every clock cycle. (Update)

Cited by:   More
Path-Equivalent Removals of ε-transitions in a.. - Giraud, Veber, Lavenier (2006)   (Correct)

Active bibliography (related documents):   More   All
1.0:   Dealing with Hardware Space Limits When Removing.. - Giraud, Lavenier (2005)   (Correct)
0.7:   Dealing with Size Limits in a Hardware Encoding of Weighted.. - Giraud, Lavenier (2004)   (Correct)
0.2:   Spatial Computation - Mihai Budiu Girish (2004)   (Correct)

Similar documents based on text:
5.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

Giraud, M., Lavenier, D.: Linear encoding scheme for weighted finite automata. In: Ninth International Conference on Implementation and Application of Automata (CIAA 2004), LNCS 3317. (2004) http://citeseer.ist.psu.edu/giraud05linear.html   More

@misc{ giraud04linear,
  author = "M. Giraud and D. Lavenier",
  title = "Linear encoding scheme for weighted finite automata",
  text = "Giraud, M., Lavenier, D.: Linear encoding scheme for weighted finite automata.
    In: Ninth International Conference on Implementation and Application of
    Automata (CIAA 2004), LNCS 3317. (2004)",
  year = "2004",
  url = "citeseer.ist.psu.edu/giraud05linear.html" }
Citations (may not include all citations):
196   Fast Text Searching Allowing Errors (context) - Wu, Manber - 1992  DBLP
37   Weighted Automata in Text and Speech Processing - Mohri, Pereira et al. - 1996
29   JBits: A Javabased Interface for Reconfigurable Computing - Guccione, Levi et al. - 1999
24   Fast Regular Expression Matching using FPGAs - Sidhu, Prasanna - 2001
22   Image Compression Using Weighted Finite Automata (context) - Culik, Kari - 1993  ACM   DBLP
14   A Generalized Profile Syntax for Biomolecular Sequences Moti.. (context) - Bucher, Bairoch - 1994
5   the Determinization of Weighted Finite Automata - Buchsbaum, Ra et al. - 2001
4   Very Large Scale Spatial Computing (context) - DeHon - 2002  ACM   DBLP
4   A reconfigurable parallel disk system for filtering genomic .. (context) - Lavenier, Guyetant et al. - 2003  DBLP
2   Stratgies de codage des automates pour des applications bass.. (context) - Dunoyer, Ptrot et al. - 1997
2   Field Programmable Gate Array (context) - Sanchez - 1996
1   cient Simulation of Nondeterministic Weighted Finite Automat.. (context) - Eramian - 2002

Documents on the same site (http://www2.lifl.fr/~giraud/bib-magiraud_bib.html):   More
Dealing with Hardware Space Limits When Removing.. - Giraud, Lavenier (2005)   (Correct)
Path-Equivalent Removals of ε-transitions in a.. - Giraud, Veber, Lavenier (2006)   (Correct)
Maximal repetitions and Application to DNA sequences - Giraud, Kucherov (2000)   (Correct)

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