An efficient incremental DFA minimization algorithm

Natural Language Engineering

Volumn 9, Issue 1, 2003, Pages 49-64

  Watson, Bruch W ^a,b   Daciuk, Jan ^c,d  

^a UNIVERSITY OF PRETORIA   (South Africa)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

^d GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; OPTIMIZATION; SET THEORY;

QUADRATIC-TIME ALGORITHMS;

FINITE AUTOMATA;

EID: 0038004129     PISSN: 13513249     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1351324903003127     Document Type: Article

References (9)

1. Ullman, A. V., Hopcroft, J. E. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. ten Eikelder, H. M. M. (1991) Some algorithms to decide the equivalence of recursive types. Technical Report 31, Faculty of Computing Science, Eindhoven University of Technology. The Netherlands.
3. Hopcroft, J. E. (1971) An n log n Algorithm for Minimizing the States in a Finite Automaton. pp. 189-196. Academic Press.
4. Hopcroft, J. E. and Ullman, J. D. (1979) Introduction to Automata Theory. Languages, and Computation. Addison-Wesley.
5. Nederhof, M.-J. (2000) Practical experiments with regular approximation of context-free languages. Computational Linguistics 26(1): 17-44.
6. van Noord, G. (2000) The treatment of epsilon moves in subset construction. Computational Linguistics 26(1): 17-44.
7. Watson, B. W. (1995) Taxonomies and toolkits of regular language algorithms. PhD thesis. Faculty of Computing Science, Eindhoven University of Technology, The Netherlands.
8. Watson, B. W. (2001) An incremental DFA minimization algorithm. In: Karttunen, L., Koskenniemi, K. and van Noord. G. (eds), Proceedings Second International Workshop on Finite State Methods in Natural Language Processing, Helsinki, Finland.
9. Wood, D. (1987) Theory of Computation. Harper & Row.