NFA reduction algorithms by means of regular inequalities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2710, Issue , 2003, Pages 194-205

  Champarnaud, Jean Marc ^a   Coulon, Fabien ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; PIPELINE PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

DETERMINIZATION; EQUIVALENCE RELATIONS; EXACT COMPUTATIONS; MATRIX PRODUCTS; NONDETERMINISTIC AUTOMATA; NUMBER OF STATE; REDUCTION ALGORITHMS; TIME COMPLEXITY;

APPROXIMATION ALGORITHMS;

EID: 35248863375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45007-6_15     Document Type: Article

References (14)

1. J. Amilhastre, P. Janssen, and M.C. Vilarem. FA minimization heuristics for a class of finite languages. In O. Boldt and H. Jürgensen, editors, Automata Implementation, WIA'99, Lecture Notes in Computer Science, volume 2214, pages 1-12. Springer, 2001.
2. V. Antimirov. Rewriting regular inequalities. Lecture notes in computer science, 965:116-125, 1995.
3. J.A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, MRI Symposia Series, 12:529-561, 1962.
4. J.-M. Champarnaud and F. Coulon. Theoretical study and implementation of the canonical automaton. Technical Report AIA 2003.03, LIFAR, Université de Rouen, 2003.
5. J.-M. Champarnaud, F. Coulon, and T. Paranthoën. Compact and fast algorithms for regular expression search. Technical Report AIA 2003.01, LIFAR, Université de Rouen, 2003.
6. J. Daciuk, B.-W. Watson, and R.-E. Watson. Incremental construction of minimal acyclic finite state automata and transducers. In L. Karttunen, editor, FSMNLP'98, pages 48-55. Association for Computational Linguistics, Somerset, New Jersey, 1998.
7. John E. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971.
8. H. Hunt, D. Rosenkrantz, and T. Szymanski. On the equivalence, containment and covering problems for the regular and context-free languages. J. Comput. System Sci., 12:222-268, 1976.
9. L. Ilie and S. Yu. Algorithms for computing small NFAs. In K. Diks and W. Rytter, editors, Lecture Notes in Computer Science, volume 2420, pages 328-340. Springer, 2002.
10. J. Jaja. An introduction to parallel algorithms. Addison-Wesley, 1992.
11. T. Jiang and B. Ravikumar. Minimal NFA problems are hard. SIAM J. Comput. Vol 22, No 6, pages 1117-1141, 1993.
12. T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. IEEE Trans. Comp., C(19):617-627, 1970.
13. H. Sengoku. Minimization of nondeterministic finite automata. Master's thesis, Kyoto University, 1992.
14. S. Wu and U. Manber. Fast text searching algorithm allowing errors. In Communication of the ACM, 31, pages 83-91, October 1992.