Skip to main content
SpringerLink
Log in

A New Approach to the Paperfolding Sequences

  • Conference paper
  • First Online:
Evolving Computability (CiE 2015)

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

Included in the following conference series:

  • 663 Accesses

Abstract

In this paper we show how to re-derive known results about the paperfolding sequences, and obtain new ones, using a new approach using a decision method and some machine computation. We also obtain exact expressions for the recurrence and appearance function of the paperfolding sequences, and solve an open problem of Rampersad about factors shared in common between two different paperfolding sequences.

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. Allouche, J.P.: The number of factors in a paperfolding sequence. Bull. Aust. Math. Soc. 46, 23–32 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Allouche, J.P., Bousquet-Mélou, M.: Canonical positions for the factors in the paperfolding sequences. Theor. Comput. Sci. 129, 263–278 (1994)

    Article  MATH  Google Scholar 

  3. Allouche, J.P., Bousquet-Mélou, M.: Facteurs des suites de Rudin-Shapiro généralisées. Bull. Belg. Math. Soc. 1, 145–164 (1994)

    MATH  Google Scholar 

  4. Allouche, J.P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410, 2795–2803 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Charlier, E., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Int. J. Found. Comp. Sci. 23, 1035–1066 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cobham, A.: Uniform tag sequences. Math. Syst. Theory 6, 164–192 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  7. Davis, C., Knuth, D.E.: Number representations and dragon curves-I, II. J. Recreat. Math. 3(66–81), 133–149 (1970)

    MathSciNet  Google Scholar 

  8. Dekking, F.M., Mendès France, M., Poorten, A.J.v.d.: Folds! Math. Intell. 4, 130–138, 173–181, 190–195 (1982). Erratum 5, 5 (1983)

    Google Scholar 

  9. Goč, D., Henshall, D., Shallit, J.: Automatic theorem-proving in combinatorics on words. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 180–191. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Kao, J.Y., Rampersad, N., Shallit, J., Silva, M.: Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391, 126–137 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Prodinger, H., Urbanek, F.J.: Infinite 0-1-sequences without long adjacent identical blocks. Discrete Math. 28, 277–289 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Schaeffer, L.: Deciding properties of automatic sequences. Master’s thesis, University of Waterloo, School of Computer Science (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Daniel Goč, Hamoon Mousavi, Luke Schaeffer & Jeffrey Shallit

  2. Queen’s University, Kingston, Ontario

    Daniel Goč

  3. McAfee Software, Waterloo, Ontario

    Hamoon Mousavi

  4. MIT, Cambridge, MA

    Luke Schaeffer

Authors
  1. Daniel Goč
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamoon Mousavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luke Schaeffer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jeffrey Shallit
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jeffrey Shallit .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

  3. Sofia University, Sofia, Bulgaria

    Mariya Soskova

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Goč, D., Mousavi, H., Schaeffer, L., Shallit, J. (2015). A New Approach to the Paperfolding Sequences. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20028-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20027-9

  • Online ISBN: 978-3-319-20028-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation