Skip to main content
SpringerLink
Log in

Decidability of Right One-Way Jumping Finite Automata

  • Conference paper
  • First Online:
Book cover Developments in Language Theory (DLT 2018)

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

Included in the following conference series:

Abstract

We continue our investigation [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, number 10952 in LNCS, 2018] on (right) one-way jumping finite automata (ROWJFA), a variant of jumping automata, which is an automaton model for discontinuous information processing. Here we focus on decision problems for ROWJFAs. It turns out that most problems such as, e.g., emptiness, finiteness, universality, the word problem and variants thereof, closure under permutation, etc., are decidable. Moreover, we show that the containment of a language within the strict hierarchy of ROWJFA permutation closed languages induced by the number of accepting states as well as whether permutation closed regular or jumping finite automata languages can be accepted by ROWJFAs is decidable, too. On the other hand, we prove that for (linear) context-free languages the corresponding ROWJFA acceptance problem becomes undecidable. Moreover, we also discuss some complexity results for the considered decision problems.

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

Access this chapter

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

Institutional subscriptions

References

  1. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143–177 (1961)

    MathSciNet  MATH  Google Scholar 

  2. Beier, S., Holzer, M.: Properties of right one-way jumping finite automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 11–23. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-319-94631-3_2

    Chapter  Google Scholar 

  3. Beier, S., Holzer, M., Kutrib, M.: Operational state complexity and decidability of jumping finite automata. In: Charlier, É., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 96–108. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62809-7_6

    Chapter  Google Scholar 

  4. Chigahara, H., Fazekas, S., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(3), 391–405 (2016)

    Article  MathSciNet  Google Scholar 

  5. Fazekas, S.Z., Yamamura, A.: On regular languages accepted by one-way jumping finite automata. In: 8th NCMA, Short Papers in books@ocg.atbooks@ocg.at, pp. 7–14, Österreichische Computer Gesellschaft, Debrecen, Hungary (2016)

    Google Scholar 

  6. Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 89–101. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22360-5_8

    Chapter  MATH  Google Scholar 

  7. Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata (2015). http://arxiv.org/abs/1512.00482,

  8. Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Trans. AMS 113, 333–368 (1964)

    MathSciNet  MATH  Google Scholar 

  9. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)

    MATH  Google Scholar 

  10. Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935–938 (1988)

    Article  MathSciNet  Google Scholar 

  11. Kopczyński, E.: Complexity of problems of commutative grammars. Logical Methods in Computer Science, 11(1): Paper 9 (2015)

    Google Scholar 

  12. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)

    Article  MathSciNet  Google Scholar 

  13. Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, New York (2014). https://doi.org/10.1007/978-1-4939-0369-6

    Book  MATH  Google Scholar 

  14. Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279–284 (1988)

    Article  MathSciNet  Google Scholar 

  15. Vorel, V.: Basic properties of jumping finite automata (2015). http://arxiv.org/abs/1511.08396v2,

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Simon Beier & Markus Holzer

Authors
  1. Simon Beier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Markus Holzer .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beier, S., Holzer, M. (2018). Decidability of Right One-Way Jumping Finite Automata. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation