Erratum: NFA reduction algorithms by means of regular inequalities (Theoretical Computer Science (2004) 327 (241-253) PII: S0304397505005062 DOI: 10.1016/j.tcs.2004.02.048);NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science

Volumn 327, Issue 3, 2004, Pages 241-253

  Champarnaud, J M ^a   Coulon, F ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Automata; NFA; Nondeterministic; Preorder; Reduction; Simulation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

NFA; NONDETERMINISTIC AUTOMATA; PREORDER;

AUTOMATA THEORY;

EID: 6344231665     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.001     Document Type: Erratum

References (14)

1. J. Amilhastre, P. Janssen, M.C. Vilarem, FA minimization heuristics for a class of finite languages, in: O. Boldt, H. Jürgensen (Eds.), Automata Implementation, WIA'99, Lecture Notes in Computer Science, Vol. 2214, Springer, Berlin, 2001, pp. 1-12.
2. V. Antimirov, Rewriting regular inequalities, Lecture Notes in Comput. Sci. 965 (1995) 116-125.
3. J.A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, Math. Theory Automat. MRI Sympos. Ser. 12 (1962) 529-561.
4. J.-M. Champarnaud, F. Coulon, Theoretical study and implementation of the canonical automaton, Fund. Inform. 55 (2003) 23-38.
5. J.-M. Champarnaud, F. Coulon, T. Paranthoën, Compact and fast algorithms for safe regular expression search, Int. J. Comput. Math. 81 (2004) 383-401.
6. J.E. Hopcroft, An n log n algorithm for minimizing the states in a finite automaton, in: Z. Kohavi (Ed.), The Theory of Machines and Computations, Academic Press, New York, 1971, pp. 189-196.
7. H. Hunt, D. Rosenkrantz, T. Szymanski, On the equivalence, containment and covering problems for the regular and context-free languages, J. Comput. System Sci. 12 (1976) 222-268.
8. L. Ilie, S. Yu, Algorithms for computing small NFAs, in: K. Diks, W. Rytter (Eds.), Lecture Notes in Computer Science, Vol. 2420, Springer, Berlin, 2002, pp. 328-340.
9. J. Jaja, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
10. T. Jiang, B. Ravikumar, Minimal NFA problems are hard, SIAM J. Comput. 22 (6) (1993) 1117-1141.
11. T. Kameda, P. Weiner, On the state minimization of nondeterministic finite automata, IEEE Trans. Comput. C( 19) (1970) 617-627.
12. H. Sengoku, Minimization of nondeterministic finite automata, Master's Thesis, Kyoto University, 1992.
13. B.-W. Watson, J. Daciuk, An efficient incremental DFA minimization algorithm, Natur. Language Eng. 9 (1) (2003) 49-64.
14. S. Wu, U. Manber, Fast text searching algorithm allowing errors, Comm. ACM 31 (1992) 83-91.