Skip to main content
SpringerLink
Log in
Book cover

International Conference on Descriptional Complexity of Formal Systems

DCFS 2019: Descriptional Complexity of Formal Systems pp 74–85Cite as

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)

  • Conference paper
  • First Online:

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

Abstract

Right one-way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or \(\lambda \)-transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters.

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. 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, Cham (2018). https://doi.org/10.1007/978-3-319-94631-3_2

    Chapter  Google Scholar 

  2. Beier, S., Holzer, M.: Semi-linear lattices and right one-way jumping finite automata (extended abstract). In: Hospodár, M., Jirásková, G. (eds.) CIAA 2019. LNCS, vol. 11601. Springer, Cham (2019, to appear)

    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). https://doi.org/10.1142/S0129054116400165

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

  6. Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theoret. Comput. Sci. 679, 31–52 (2017). https://doi.org/10.1016/j.tcs.2016.07.006

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

    MATH  Google Scholar 

  8. Lavado, G.J., Pighizzini, G., Seki, S.: Operational state complexity under parikh equivalence. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 294–305. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09704-6_26

    Chapter  MATH  Google Scholar 

  9. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012). https://doi.org/10.1142/S0129054112500244

  10. Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Bel-Enguix, G., Dahl, V., De La Puente, A.O. (eds.) Proceedings 1st Workshop on AI Methods for Interdisciplinary Research in Language and Biology (BILC 2011), pp. 3–13. SciTePress, Setúbal (2011). https://doi.org/10.5220/0003272500030013

  11. Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci. 29(1), 1–16 (2018). https://doi.org/10.1142/S0129054118500016

  12. Yen, H.-C.: Petri nets and semilinear sets (extended abstract). In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 25–29. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46750-4_2

    Chapter  Google Scholar 

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. Slovak Academy of Sciences, Košice, Slovakia

    Michal Hospodár

  2. Slovak Academy of Sciences, Košice, Slovakia

    Galina Jirásková

  3. Saint Mary's University, Halifax, NS, Canada

    Stavros Konstantinidis

Rights and permissions

Reprints and permissions

Copyright information

© 2019 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beier, S., Holzer, M. (2019). Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). In: Hospodár, M., Jirásková, G., Konstantinidis, S. (eds) Descriptional Complexity of Formal Systems. DCFS 2019. Lecture Notes in Computer Science(), vol 11612. Springer, Cham. https://doi.org/10.1007/978-3-030-23247-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23247-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23246-7

  • Online ISBN: 978-3-030-23247-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation