Skip to main content
SpringerLink
Log in

State Complexity and Jacobsthal’s Function

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2088))

Included in the following conference series:

Abstract

We find bounds for the state complexity of the intersection of regular languages over an alphabet of one letter. There is an interesting connection to Jacobsthal’s function from number theory.

Research supported in part by a grant from NSERC.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.D. Adhikari and R. Balasubramanian. On a question regarding visibility of lattice points. Mathematika, 43:155–158, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Bach and J. Shallit. Algorithmic Number Theory. MIT Press, 1996.

    Google Scholar 

  3. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  4. H. Iwaniec. On the problem of Jacobsthal. Dem. Math., 11:225–231, 1978.

    MATH  MathSciNet  Google Scholar 

  5. E. Jacobsthal. Über Sequenzen ganzer Zahlen. von denen keine zu n teilerfremd ist. I-III. Norske Vid. Selsk. Forh. Trondheim, 33:117–139, 1960.

    MathSciNet  Google Scholar 

  6. H.-J. Kanold. Über eine zahlentheoretische Funktion von Jacobsthal. Math. Annalen, 170:314–326, 1967.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Nicaud. Average state complexity of operations on unary automata. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Proc. 24nd Symposium, Mathematical Foundations of Computer Science 1999, volume 1672 of Lecture Notes in Computer Science, pages 231–240. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  8. G. Pighizzini. Unary language concatenation and its state complexity. Proc. CIAA 2000.

    Google Scholar 

  9. G. Robin. Estimation de la fonction de Tchebychef Ø sur le k-iéme nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n. Acta Arith., 42:367–389, 1983.

    MATH  MathSciNet  Google Scholar 

  10. S. Yu. State complexity of regular languages. In International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Preproceedings, pages 77–88. Department of Computer Science, Otto-von-Guericke University of Magdeburg, July 1999.

    Google Scholar 

  11. S. Yu and Q. Zhuang. On the state complexity of intersection of regular languages. SIGACT News, 22(3):52–54, Summer 1991.

    Article  Google Scholar 

  12. S. Yu, Q. Zhuang, and K. Salomaa. The state complexity of some basic operations on regular languages. Theoret. Comput. Sci., 125:315–328, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    Jeffrey Shallit

Authors
  1. Jeffrey Shallit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shallit, J. (2001). State Complexity and Jacobsthal’s Function. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation