8 search results - page 2 / 2 » Incremental Construction of Minimal Acyclic Finite State Aut... |
WIA
2005
Springer
14 years 1 months ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
ACL
1996
13 years 9 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...