Skip to main content
SpringerLink
Log in

An Early Completion Algorithm: Thue’s 1914 Paper on the Transformation of Symbol Sequences

  • Conference paper
Language, Life, Limits (CiE 2014)

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

Included in the following conference series:

  • 718 Accesses

Abstract

References to Thue’s 1914 paper on string transformation systems are based mainly on a small section of that work defining Thue systems. A closer study of the remaining parts of that paper highlight a number of important themes in the history of computing: the transition from algebra to formal language theory, the analysis of the “computational power” (in a pre-1936 sense) of rules, and the development of algorithms to generate rule-sets.

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. Thue, A.: Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Christiana Videnskabs-Selskabs Skrifter, I. Math.-naturv. Klasse 10 (1914)

    Google Scholar 

  2. Post, E.L.: Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic 12(1), 1–11 (1947)

    Article  MATH  MathSciNet  Google Scholar 

  3. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997)

    Google Scholar 

  4. Book, R.V., Otto, F.: String-rewriting Systems. Springer (1993)

    Google Scholar 

  5. Nagell, T., Selberg, A., Selberg, S., Thalberg, K. (eds.): Selected Mathematical Papers of Axel Thue. Universitetsforlaget, Oslo (1977)

    Google Scholar 

  6. Thue, A.: Über unendliche Zeichenreihen. Christiana Videnskabs-Selskabs Skrifter. I. Math. -Naturv. Klasse 7 (1906)

    Google Scholar 

  7. Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Christiana Videnskabs-Selskabs Skrifter, I. Math. -Naturv. Klasse 1 (1912)

    Google Scholar 

  8. Berstel, J.: Axel Thue’s papers on repetitions in words: a translation. Publications du LaCIM, Université du Québec à Montréal (1995)

    Google Scholar 

  9. Marcus, S.: Words and languages everywhere. In: Martin-Vide, C., Mitrana, V., Paun, G. (eds.) Formal Languages and Applications, pp. 11–53. Springer (2004)

    Google Scholar 

  10. Thue, A.: Die Lösung eines Spezialfalles eines generellen logischen Problems. Christiana Videnskabs-Selskabs Skrifter, I. Math.-naturv. Klasse 8 (1910)

    Google Scholar 

  11. Steinby, M., Thomas, W.: Trees and term rewriting in 1910: On a paper by Axel Thue. EATCS Bull. 72, 256–269 (2000)

    MathSciNet  Google Scholar 

  12. Buchberger, B.: History and basic features of the critical-pair/completion procedure. Journal of Symbolic Computation 3(1-2), 3–38 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  13. Newman, M.: On theories with a combinatorial definition of “equivalence”. Annals of Mathematics 43(2), 223–243 (1942)

    Article  MATH  MathSciNet  Google Scholar 

  14. Matiyasevicha, Y., Sénizergue, G.: Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science (330), 145–169 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Ireland, Maynooth, Co. Kildare, Ireland

    James F. Power

Authors
  1. James F. Power
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Department of Computer Science, Swansea University, SA2 8PP, Swansea, UK

    Arnold Beckmann

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/c,, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  3. Computer Science Institute, Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany

    Klaus Meer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Power, J.F. (2014). An Early Completion Algorithm: Thue’s 1914 Paper on the Transformation of Symbol Sequences. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08019-2_35

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08018-5

  • Online ISBN: 978-3-319-08019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation