Exact complexity of problems of incompletely specified automata

Annals of Mathematics and Artificial Intelligence

Volumn 16, Issue 1, 1996, Pages 237-249

  Creignou, Nadia ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26444476090     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02127799     Document Type: Article

References (13)

1. N. Creignou, The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness, Theor. Comp. Sci. 145(1995)111-145.
2. A.K. Dewdney Linear transformations between combinatorial problems, Int. J. Comp. Math. 11(1982)91-110.
3. M.R. Garey and G.S. Johnson, Computers and Intractability: A Guide for the Theory of NP-Completeness (Freeman, San Francisco, 1979).
4. E.M. Gold, Complexity of automaton identification from given data, Inf. Contr. 37(1978)302-320.
5. E. Grandjean, Non-trivial lower bound for an NP-complete problem on automata, SIAM J. Comput. 19(1990)438-451.
6. E. Grandjean, Linear time algorithms and NP-complete problems, SIAM J. Comput. 23(1994)573-597.
7. E. Grandjean, Sorting, linear time and the satisfiability problem, this volume, Ann. of Math. and AI 16(1996).
8. J. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, Theory of Machines and Computations, eds. Z. Kohavi and A. Paz (Academic Press, New York, 1971) pp. 189-196.
9. J. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, MA, 1979).
10. W.J. Paul, N. Pippenger, E. Szemeredi and W.T. Trotter, On determinism versus nondeterminsim and related problems, Proc. 24th Symp. on Foundations of Computer Science (IEEE Computer Society, Washington, DC, 1983) pp. 429-438.
11. C.P. Pfleeger, State reduction in incompletely specified finite-state machines, IEEE Trans. Comput. 22(1973)1099-1102.
12. S. Ranaivoson, Bornes inférieures non triviales pour des problèmes NP-complets en théorie des graphes et des automates, Thèse de doctorat, Université de Caen, France (1991).
13. B. Reush and W. Merzenich, Minimal covering for incompletely specified sequential machines, Acta Informatica 22(1986)663-678.