Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2015: Implementation and Application of Automata pp 279–291Cite as

Checking Whether an Automaton Is Monotonic Is NP-complete

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9223))

Abstract

An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is obtained for oriented automata, whose states can be arranged in a cyclic order. Moreover, both problems remain hard under the restriction to binary input alphabets.

M. Szykuła—Supported in part by Polish NCN grant DEC-2013/09/N/ST6/01194.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 111–121. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1), 3–13 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berlinkov, M.V.: Approximating the minimum length of synchronizing words is hard. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 37–47. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Brzozowski, J., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Sys. Sci. 16(1), 37–55 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brzozowski, J., Li, B., Liu, D.: Syntactic complexities of six classes of star-free languages. J. Automata Lang. Comb. 17(2–4), 83–105 (2012)

    MathSciNet  Google Scholar 

  6. Brzozowski, J., Shallit, J., Xu, Z.: Decision problems for convex languages. Inform. Comput. 209(3), 353–367 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brzozowski, J., Szykuła, M.: Large aperiodic semigroups. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 124–135. Springer, Heidelberg (2014)

    Google Scholar 

  8. Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theor. Comput. Sci. 88(1), 99–116 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gerbush, M., Heeringa, B.: Approximating minimum reset sequences. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 154–162. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Gomes, G., Howie, J.: On the ranks of certain semigroups of order-preserving transformations. Semigroup Forum 45, 272–282 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Grech, M., Kisielewicz, A.: The Černý conjecture for automata respecting intervals of a directed graph. Discrete Math. Theor. Comput. Sci. 15(3), 61–72 (2013)

    MathSciNet  MATH  Google Scholar 

  13. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inf. Comput. 209(3), 456–470 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Iván, S., Nagy-György, J.: On nonpermutational transformation semigroups with an application to syntactic complexity (2014). http://arxiv.org/abs/1402.7289

  15. Kim, S.M., McNaughton, R., McCloskey, R.: A polynomial time algorithm for the local testability problem of deterministic finite automata. IEEE Trans. Comput. 40(10), 1087–1093 (1991)

    Article  MathSciNet  Google Scholar 

  16. Kisielewicz, A., Kowalski, J., Szykuła, M.: Computing the shortest reset words of synchronizing automata. J. Comb. Optim. 29(1), 88–124 (2015)

    Article  MathSciNet  Google Scholar 

  17. Kisielewicz, A., Szykuła, M.: Generating small automata and the Černý conjecture. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 340–348. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Kisielewicz, A., Szykuła, M.: Synchronizing Automata with Large Reset Lengths (2014). http://arxiv.org/abs/1404.3311

  19. Kudłacik, R., Roman, A., Wagner, H.: Effective synchronizing algorithms. Expert Sys. Appl. 39(14), 11746–11757 (2012)

    Article  Google Scholar 

  20. Martyugin, P.V.: Complexity of problems concerning reset words for some partial cases of automata. Acta Cybernetica 19, 517–536 (2009)

    MathSciNet  MATH  Google Scholar 

  21. McNaughton, R., Papert, S.A.: Counter-Free Automata, volume 65 of MIT Research Monographs. The MIT Press, Cambridge (1971)

    Google Scholar 

  22. Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: 27th Annual Symposium on Foundations of Computer Science, pp. 132–142 (1986)

    Google Scholar 

  23. Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568–579. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  24. Rho, J.-K., Somenzi, F., Pixley, C.: Minimum length synchronizing sequences of finite state machine. In: Proceedings of the 30th ACM/IEEE Design Automation Conference (DAC1993), pp. 463–468 (1993)

    Google Scholar 

  25. Sandberg, S.: 1 Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Advanced Lectures. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Schaefer, T.J.: The Complexity of Satisfiability Problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 216–226. ACM (1978)

    Google Scholar 

  27. Skvortsov, E., Tipikin, E.: Experimental study of the shortest reset word of random automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 290–298. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  28. Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theor. Comput. Sci. 410(37), 3513–3519 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Marek Szykuła

Authors
  1. Marek Szykuła
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marek Szykuła .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Szykuła, M. (2015). Checking Whether an Automaton Is Monotonic Is NP-complete. In: Drewes, F. (eds) Implementation and Application of Automata. CIAA 2015. Lecture Notes in Computer Science(), vol 9223. Springer, Cham. https://doi.org/10.1007/978-3-319-22360-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22360-5_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22359-9

  • Online ISBN: 978-3-319-22360-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation