Skip to main content
SpringerLink
Log in

Exact complexity of problems of incompletely specified automata

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

This paper is devoted to the study ofreduction of incompletely specified automata (RISA). A variant of this problem consists in having a set of initial states (instead of a unique initial state) and is denoted by RISS. The problemk-RISAr (resp.k-RISSr) is the restricted version in which the number of states of the reduced automaton,k, and the size of the input alphabet,r, are fixed. We prove thatk-RISAr is in P, whereask-RISSr is NP-complete (and even linearly equivalent to SAT) fork ≥ 11 andr ≥ 2, thus completing the study of computational complexity of problems of reduction of incompletely specified automata and structures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Google Scholar 

  2. A.K. Dewdney Linear transformations between combinatorial problems, Int. J. Comp. Math. 11(1982)91–110.

    Google Scholar 

  3. M.R. Garey and G.S. Johnson,Computers and Intractability: A Guide for the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    Google Scholar 

  4. E.M. Gold, Complexity of automaton identification from given data, Inf. Contr. 37(1978)302–320.

    Google Scholar 

  5. E. Grandjean, Non-trivial lower bound for an NP-complete problem on automata, SIAM J. Comput. 19(1990)438–451.

    Google Scholar 

  6. E. Grandjean, Linear time algorithms and NP-complete problems, SIAM J. Comput. 23(1994)573–597.

    Google Scholar 

  7. E. Grandjean, Sorting, linear time and the satisfiability problem, this volume, Ann. of Math. and AI 16(1996).

  8. J. Hopcroft, Ann logn 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.

    Google Scholar 

  9. J. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages and Computation (Addison-Wesley, MA, 1979).

    Google Scholar 

  10. W.J. Paul, N. Pippenger, E. Szemeredi and W.T. Trotter, On determinism versus nondeterminism and related problems,Proc. 24th Symp. on Foundations of Computer Science (IEEE Computer Society, Washington, DC, 1983) pp. 429–438.

    Google Scholar 

  11. C.P. Pfleeger, State reduction in incompletely specified finite-state machines, IEEE Trans. Comput. 22(1973)1099–1102.

    Google Scholar 

  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).

    Google Scholar 

  13. B. Reush and W. Merzenich, Minimal covering for incompletely specified sequential machines, Acta Informatica 22(1986)663–678.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques, Université de Caen, 14032, Caen Cedex, France

    Nadia Creignou

Authors
  1. Nadia Creignou
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Creignou, N. Exact complexity of problems of incompletely specified automata. Ann Math Artif Intell 16, 237–249 (1996). https://doi.org/10.1007/BF02127799

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02127799

Keywords

Search

Navigation