Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On the Complexity of Intersecting Finite State Automata
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
Semiring Lattice Parsing Applied to CYK
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Natural Language Engineering
Finite-State Technology as a Programming Environment
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Transducer Minimization and Information Compression for NooJ Dictionaries
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
An annotated k-deep prefix tree for (1-k)-mer based sequence comparisons
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Large-scale training of SVMs with automata kernels
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
Daciuk et al. [Computational Linguistics 26(1):3-16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finite-state automata (dictionaries) from sets of strings. But acyclic finite-state automata have limitations: For instance, if one wants a linguistic application to accept all possible integer numbers or Internet addresses, the corresponding finite-state automaton has to be cyclic. In this article, we describe a simple and equally efficient method for modifying any minimal finite-state automaton (be it acyclic or not) so that a string is added to or removed from the language it accepts; both operations are very important when dictionary maintenance is performed and solve the dictionary construction problem addressed by Daciuk et al. as a special case. The algorithms proposed here may be straightforwardly derived from the customary textbook constructions for the intersection and the complementation of finite-state automata; the algorithms exploit the special properties of the automata resulting from the intersection operation when one of the finite-state automata accepts a single string.