Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2017: Developments in Language Theory pp 96–108Cite as

Operational State Complexity and Decidability of Jumping Finite Automata

  • Conference paper
  • First Online:

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

Abstract

We consider jumping finite automata and their operational state complexity and decidability status. Roughly speaking, a jumping automaton is a finite automaton with a non-continuous input. This device has nice relations to semilinear sets and thus to Parikh images of regular sets, which will be exhaustively used in our proofs. In particular, we prove upper bounds on the intersection and complementation. The latter result on the complementation upper bound answers an open problem from G.J. Lavado, G. Pighizzini, S. Seki: Operational State Complexity of Parikh Equivalence [2014]. Moreover, we correct an erroneous result on the inverse homomorphism closure. Finally, we also consider the decidability status of standard problems as regularity, disjointness, universality, inclusion, etc. for jumping finite 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. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval: The Concepts and Technology Behind Search. Addison-Wesley, New York (2011)

    Google Scholar 

  2. Beier, S., Holzer, M., Kutrib, M.: On the descriptional complexity of operations on semilinear sets. IFIG Research Report 1701, Institut für Informatik, Universität Giessen (2017). http://www.informatik.uni-giessen.de/reports/Report1701.pdf

  3. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35, 413–422 (1913)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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). doi:10.1007/978-3-319-22360-5_8

    Chapter  Google Scholar 

  5. Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679, 31–52 (2017)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  8. Huynh, D.T.: Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is \(\Sigma _2^{p}\)-complete. Theor. Comput. Sci. 33, 305–326 (1984)

    Article  MATH  Google Scholar 

  9. Huynh, D.T.: The complexity of equivalence problems for commutative grammars. Inf. Control 66, 103–121 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Huynh, D.T.: A simple proof for the \(\Sigma _2^P\) upper bound of the inequivalence problem for semilinear sets. Elektr. Informationsverarb. Kybernet. 22, 147–156 (1986)

    MATH  Google Scholar 

  11. Huynh, T.-D.: The complexity of semilinear sets. In: Bakker, J., Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 324–337. Springer, Heidelberg (1980). doi:10.1007/3-540-10003-2_81

    Chapter  Google Scholar 

  12. Kopczyńki, E., To, A.W.: Parikh images of grammar: Complexity and applications. In: Joiannaud, J.P. (ed.) Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, pp. 80–89. IEEE (2010)

    Google Scholar 

  13. Kopczyński, E.: Complexity of problems of commutative grammars. Log. Methods Comput. Sci. 11(1) (2015). Paper 9

    Google Scholar 

  14. Lavado, G.J., Pighizzini, G., Seki, S.: Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput. 228–229, 1–15 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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). doi:10.1007/978-3-319-09704-6_26

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. To, A.W.: Parikh images of regular languages: complexity and applications (2010). http://arxiv.org/abs/1002.1464v2

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

  19. Vorel, V.: Two results on discontinuous input processing. In: Câmpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 205–216. Springer, Cham (2016). doi:10.1007/978-3-319-41114-9_16

    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 & Martin Kutrib

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

  3. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Beier .

Editor information

Editors and Affiliations

  1. Université de Liège, Liège, Belgium

    Émilie Charlier

  2. Université de Liège, Liège, Belgium

    Julien Leroy

  3. Université de Liège, Liège, Belgium

    Michel Rigo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Beier, S., Holzer, M., Kutrib, M. (2017). Operational State Complexity and Decidability of Jumping Finite Automata. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62809-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62808-0

  • Online ISBN: 978-3-319-62809-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation