Fast text searching: allowing errors
Communications of the ACM
On the Determinization of Weighted Finite Automata
SIAM Journal on Computing
Field Programmable Gate Array (FPGA) Circuits
Papers from an international workshop on Towards Evolvable Hardware, The Evolutionary Engineering Approach
Image Compression Using Weighted Finite Automata
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Very Large Scale Spatial Computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Fast Regular Expression Matching Using FPGAs
FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Cluster of re-configurable nodes for scanning large genomic banks
Parallel Computing
Weighted Finite Automata encoding over Thai language
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Path-equivalent removals of ε-transitions in a genomic weighted finite automaton
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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.