On the minimality of finite automata and stream X-machines for finite languages

Computer Journal

Volumn 48, Issue 2, 2005, Pages 157-167

  Ipate, Florentin ^a  

^a UNIVERSITY OF PITESTI   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL MODELS; THEOREM PROVING;

FINITE LANGUAGE; STREAM X MACHINES;

FINITE AUTOMATA;

EID: 15744377854     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/bxh068     Document Type: Article

References (24)

1. Hopcroft, J. E. and Ullman, J. D. (1979) Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, MA.
2. Salomaa, A. (1969) Theory of Automata. Pergamon Press, Oxford.
3. Cohen, D. I. A. (1996) Introduction to Computer Theory (2nd edn). John Wiley & Sons, New York.
4. Salomaa, K., Yu, S. and Zhuang, Q. (1994) The state complexity of some basic operations on regular languages. Theoretical Computer Science 125, 315-328.
5. Yu, S. (1995) Regular Languages, Handbook of Formal Languages. Springer Verlag.
6. Campeanu, C., Santean, N. and Yu, S. (1999) Minimal cover automata for finite languages. Theoretical Computer Science, 267, 3-16.
7. 2) algorithm for constructing minimal cover automata for finite languages. LNCS, 2088, 243-251.
8. Eilenberg, S. (1994) Automata, Languages and Machines, Vol. A. Academic Press, New York.
9. Holcombe, M. (1988) X-machines as a basis for dynamic system specification. Software Engineering Journal, 3, 69-76.
10. Holcombe, M. and Ipate, F. (1998) Correct Systems: Building a Business Process Solution. Springer Verlag, Berlin.
11. Fairtlough, M., Holcombe, M., Ipate, F., Jordan, C., Laycock, G. and Duan, Z. (1995) Using an X-machine to model a video cassette recorder. Current Issues in Electronic Modeling, 3, 141-161.
12. Kehris, E., Eleftherakis, G. and Kefalas, P. (2000) Using X-machines to model and test discrete event simulation programs. In Mastorakis, N. (ed.), Systems and Control: Theory and Applications, pp. 163-171. World Scientific, Athens.
13. Kefalas, P. and Kapeti, E. (2000) A design language and tool for X-machine specification. In Fotiadis, D. I. and Nikolopoulos, S. D. (eds), Advances in Informatics, pp. 134-145. World Scientific, Athens.
14. Ipate, F. and Holcombe, M. (1998) A method for refining and testing generalized machine specifications. Intern. J. of Computer Math., 68, 197-219.
15. Ipate, F. and Holcombe, M. (2002) An integrated refinement and testing method for stream X-machines. Applicable Algebra in Engineering, Communication and Computing, 13, 67-91.
16. Barnard, J., Whitworth, J. and Woodward, M. (1996) Communicating X-machines. Information and Software Technology, 38, 401-407.
17. Cowling, A., Georgescu, H. and Vertan, C. (2000) A structured way to use channels for communication in X-machine systems. Formal Aspects of Computing, 12, 458-500.
18. Ipate, F. and Holcombe, M. (2002) Testing conditions for communicating stream X-machine systems. Formal Aspects of Computing, 13, 431-446.
19. Ipate, F. and Holcombe, M. (1997) An integration testing method that is proved to find all faults. Intern. J. Computer Math., 63, 159-178.
20. Ipate, F. and Holcombe, M. (1998) Specification and testing using generalized machines: a presentation and a case study. Software Testing, Verification and Reliability, 8, 61-81.
21. Ipate, F. and Holcombe, M. (2000) Generating test sequences from non-deterministic generalized stream X-machines. Formal Aspects of Computing, 12, 443-458.
22. Ipate, F. (2003) On the minimality of stream X-machines. Comput. J. 46, 295-306.
23. Lee, D. and Yannakakis, M. (1996) Principles and methods of testing finite state machines - a survey. Proc. IEEE, 84, 1090-1123.
24. Korner, H. (2003) On minimizing cover automata for finite languages in O(n log n) time. LNCS, 2608, 117-127.