Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

COLING
2000

favoriteEmaildiscussreport

74views Computational Linguistics» more COLING 2000»

Incremental Construction of Minimal Acyclic Finite State Automata

13 years 4 months ago

Incremental Construction of Minimal Acyclic Finite State Automata

Download www.cis.uni-muenchen.de

Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard

Real-time Traffic

COLING 2000 | COLING 2008 |

claim paper

Related Content

» Compilation Methods of Minimal Acyclic FiniteState Automata for Large Dictionaries

» Incremental Construction and Maintenance of Minimal FiniteState Automata

» A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata

» Incremental Construction of Minimal Sequential Transducers

» Shorter Regular Expressions from FiniteState Automata

» Head Automata and Bilingual Tiling Translation with Minimal Representations

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COLING
Authors	Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard Watson

Comments (0)