Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2015: Descriptional Complexity of Formal Systems pp 165–176Cite as

On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata

  • Conference paper
  • First Online:

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

Abstract

The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we show that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent unambiguous NFA is exponential, which yields an upper bound of \(2^{2^{O(n)}}\) for the conversion into an equivalent DFA, thus meeting the lower bound up to a constant. Based on the new transformation we then show that many decision problems, such as emptiness, finiteness, inclusion, and equivalence, are PSPACE-complete for stateless deterministic ordered restarting automata.

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. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comp. Sci. 410, 3209–3222 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Caron, P.: Families of locally testable languages. Theor. Comp. Sci. 242, 361–376 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dassow, J.: Subregular restrictions for some language generating devices. In: Freund, R., Holzer, M., Truthe, B., Ultes-Nitsche, U. (eds.) Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications (NCMA 2012). books@ocg.at, Band, vol. 290, pp. 11–26. Oesterreichische Computer Gesellschaft, Wien (2012)

    Google Scholar 

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

    Google Scholar 

  5. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inform. Comp. 209, 456–470 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hundeshagen, N., Otto, F.: Characterizing the regular languages by nonforgetting restarting automata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 288–299. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. Inform. Comp. 206, 1152–1160 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8, 60–76 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mráz, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 431–442. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  10. Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 318–329. Springer, Heidelberg (2014)

    Google Scholar 

  11. Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 679–746. Springer, Berlin (1997)

    Chapter  Google Scholar 

  12. Průša, D.: Weight-reducing Hennie machines and their descriptional complexity. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 553–564. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  13. Savitch, J.E.: Relationships between nondeterministic and deterministic tape complexities. J. Comp. Syst. Sci. 4, 177–192 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  14. Stanley, R.P.: Enumerative Combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2012)

    MATH  Google Scholar 

  15. Zalcstein, Y.: Locally testable languages. J. Comp. Syst. Sci. 6, 151–167 (1972)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Kent Kwee & Friedrich Otto

Authors
  1. Kent Kwee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Friedrich Otto .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    Jeffrey Shallit

  2. Department of Mathematics, University of Turku, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kwee, K., Otto, F. (2015). On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata. In: Shallit, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2015. Lecture Notes in Computer Science(), vol 9118. Springer, Cham. https://doi.org/10.1007/978-3-319-19225-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19225-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19224-6

  • Online ISBN: 978-3-319-19225-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation