Abstract
In this paper, we show that the linear encoding scheme efficiently implements weighted finite automata (WFA). WFA with t transitions can be hardwired with \(\mathcal{O}\)(t) cells. They solve pattern matching problems in a pipelined way, parsing one character every clock cycle. With the massive parallelism of reconfigurable processors like FPGAs, a significant speed-up is obtained against software solutions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Culik II, K., Kari, J.: Image Compression Using Weighted Finite Automata. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 392–402. Springer, Heidelberg (1993)
Mohri, M., Pereira, F., Riley, M.: Weighted Automata in Text and Speech Processing. In: Kornai, A. (ed.) Extended Finite State Models of Language (ECAI 1996), pp. 46–50 (1996)
Buchsbaum, A.L., Raffaele, G., Westbrook, J.R.: On the Determinization of Weighted Finite Automata. SIAM Journal on Computing 30, 1502–1531 (2001)
Eramian, M.G.: Efficient Simulation of Nondeterministic Weighted Finite Automata. In: Fourth Workshop on Descriptional Complexity of Formal Systems, DCFS 2002 (2002)
Sidhu, R., Prasanna, V.K.: Fast Regular Expression Matching using FPGAs. In: IEEE Symposium on Field Programmable Custom Computing Machines, FCCM 2001 (2001)
Dunoyer, J., Ptrot, F., Jacomme, L.: Stratgies de codage des automates pour des applications basse consommation: exprimentation et interprtation. In: Journes d’tude Faible Tension et Faible Consommation, FTFC 1997 (1997)
Sanchez, E.: Field Programmable Gate Array (FPGA) Circuits. LNCS, pp. 1–18. Springer, Heidelberg (1996)
Lavenier, D., Guyetant, S., Derrien, S., Rubini, S.: A reconfigurable parallel disk system for filtering genomic banks. In: Proc. Int. Conf. ERSA 2003 (2003)
Guccione, S., Levi, D., Sundararajan, P.: JBits: A Javabased Interface for Reconfigurable Computing. In: 2nd Annual Military and Aerospace Applications of Programmable Devices and Technologies Conference, MAPLD (1999)
Bucher, P., Bairoch, A.: A Generalized Profile Syntax for Biomolecular Sequences Motifs and its Function in Automatic Sequence Interpretation. In: Intelligent Systems for Molecular Biology (ISMB 1994), pp. 53–61 (1994)
Wu, S., Manber, U.: Fast Text Searching Allowing Errors. Communications of the ACM 35, 83–91 (1992)
DeHon, A.: Very Large Scale Spatial Computing. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 27–37. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giraud, M., Lavenier, D. (2005). Linear Encoding Scheme for Weighted Finite Automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)