Incremental Construction of Compact Acyclic NFAs

Details Incremental Construction of Compact Acyclic NFAs Incremental Construction of Compact Acyclic NFAs

2002-01-04

arxiv.org/abs/cs/0201002v1

Proc. ACL-2001, 39th Annual Meeting of the Association for Computational Linguistics, pp.474-481, Toulouse, France, 6-11 July

Computer Science

Data Structures and Algorithms

8(+2) pages, 4 figures, 1 table, 22 references. For related work, see also http://slt.wcl.ee.upatras.gr

Scientific paper

This paper presents and analyzes an incremental algorithm for the construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFAs that do not contain equivalent states. Unlike Deterministic Finite-state Automata (DFA), this property is not sufficient to ensure minimality, but still the resulting NFAs are considerably smaller than the minimal DFAs for the same languages.

Affiliated with

Also associated with

No associations

Rating

Incremental Construction of Compact Acyclic NFAs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Construction of Compact Acyclic NFAs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Construction of Compact Acyclic NFAs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503455