8 search results - page 1 / 2 » Incremental Construction and Maintenance of Minimal Finite-S... |
COLING
2002
14 years 10 months ago
2002
COLING
2000
14 years 10 months ago
2000
91
Voted
WIA
2001
Springer
15 years 3 months 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 ...
91
Voted
WIA
2005
Springer
15 years 4 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...
108
click to vote
ACL
1996
15 years 8 days 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...