Incremental Construction of Compact Acyclic NFAs
数据结构与算法
2007-05-23 v1 计算与语言
摘要
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.
关键词
引用
@article{arxiv.cs/0201002,
title = {Incremental Construction of Compact Acyclic NFAs},
author = {Kyriakos N. Sgarbas and Nikos D. Fakotakis and George K. Kokkinakis},
journal= {arXiv preprint arXiv:cs/0201002},
year = {2007}
}
备注
8(+2) pages, 4 figures, 1 table, 22 references. For related work, see also http://slt.wcl.ee.upatras.gr