8 search results - page 1 / 2 » Incremental Construction and Maintenance of Minimal Finite-S... |
COLING
2002
13 years 7 months ago
2002
COLING
2000
13 years 7 months ago
2000
WIA
2001
Springer
14 years 19 hour ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
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...