An efficient algorithm for constructing minimal cover automata for finite languages

International Journal of Foundations of Computer Science

Volumn 13, Issue 1, 2002, Pages 83-97

  Campeanu, Cezar ^a   Paun, Andrei ^b   Yu, Sheng ^b  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Cover Language; Deterministic Cover Automata; Deterministic Finite Automata; Finite languages

Indexed keywords

EID: 16244423788     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102000960     Document Type: Conference Paper

References (11)

1. C. Campeanu, K. Culik, K. Salomaa, S. Yu, "State Complexity of Basic Operations on Finite Languages", Proceedings of the Fourth International Workshop on Implementing Automata VIII 1-11, 1999, to appear in Springer LNCS.
2. C. Campeanu, K. Salomaa, S. Yu, "State Complexity of Regular Languages: Finite Versus Infinite", Finite vs Infinite-Contributions to an Eternal Dilemma, edited by C. Calude and G. Paun, Springer 2000, pps. 53-73.
3. C. Campeanu, N. Santean, S. Yu, "Minimal Cover-Automata for Finite Languages", Proceedings of the Third International Workshop on Implementing Automata (WIA'98) 1998, 32-42. An extended version entitled "Finite Languages and Cover-Automat a" is accepted by Theoretical Computer Science.
4. J.-M. Champarnaud and D. Maurel, Automata Implementation, Third International Workshop on Implementing Automata, LNCS 1660, Springer, 1999.
5. C. Dwork and L. Stockmeyer, "A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata", SIAM Journal on Computing, vol.19 (1990) 1011-1023.
6. M.R. Garey and D.S. Johnson, Computer and Intractability - A Guide to the Theory of NP-Completeness, Freeman, 1979.
7. J. Kaneps, R. Frievalds, "Running Time to Recognize Non-Regular Languages by 2-Way Probabilistic Automata", in ICALP'91, LNCS, Springer-Verlag, New-York/Berlin (1991) vol 510, 174-185.
8. A. Salomaa and S. Yu, "Decomposition of Finite Languages", Proceedings of Fourth International Conference on Developments in Language Theory (1999) 8-20.
9. N. Santean, Towards a Minimal Representation for Finite Languages: Theory and Practice, MSc Thesis, Department of Computer Science, The University of Western Ontario, 2000.
10. B.A. Trakhtenbrot and Ya.M. Barzdin, Finite Automata - Behavior and Synthesis, North-Holland/American Elsevier, 1973.
11. D. Wood and S. Yu, Automata Implementation, Second International Workshop on Implementing Automata, LNCS 1436, Springer, 1998.