Skip to main content
SpringerLink
Log in
Book cover

Combinatorics on Words

9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Juhani Karhumäki

    1. Department of Mathematics and TUCS, University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Arto Lepistö

    1. University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Luca Zamboni

    1. FUNDIM, University of Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 9th International Conference on Words, WORDS 2013

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 72.00
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited

    1. Which Arnoux-Rauzy Words Are 2-Balanced?

      • Julien Cassaigne
      Pages 1-2

    2. Dynamical Equivalence of Morphisms

      • Michel Dekking
      Pages 3-3

    3. Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem

      • Vesa Halava
      Pages 4-13

    4. Subword Complexity in Free Groups

      • Gilbert Levitt
      Pages 14-14

    5. Non-constructive Methods for Avoiding Repetitions in Words

      • Narad Rampersad
      Pages 15-17

    6. Words, Trees and Automata Minimization

      • Giusi Castiglione, Marinella Sciortino
      Pages 18-33

  3. Contributions

    1. Auto-similarity in Rational Base Number Systems

      • Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
      Pages 34-45

    2. Infinite Words with Well Distributed Occurrences

      • Ĺubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Svetlana Puzynina
      Pages 46-57

    3. Generating Discrete Planes with Substitutions

      • Valérie Berthé, Jérémie Bourdon, Timo Jolivet, Anne Siegel
      Pages 58-70

    4. Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm

      • Valérie Berthé, Sebastien Labbé
      Pages 71-82

    5. The Lexicographic Cross-Section of the Plactic Monoid Is Regular

      • Christian Choffrut, Robert Mercaş
      Pages 83-94

    6. Suffix Conjugates for a Class of Morphic Subshifts

      • James D. Currie, Narad Rampersad, Kalle Saari
      Pages 95-106

    7. Periodicity Forcing Words

      • Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
      Pages 107-118

    8. Balancedness of Arnoux-Rauzy and Brun Words

      • Vincent Delecroix, Tomáš Hejda, Wolfgang Steiner
      Pages 119-131

    9. Open and Closed Prefixes of Sturmian Words

      • Alessandro De Luca, Gabriele Fici
      Pages 132-142

    10. Finitely Generated Ideal Languages and Synchronizing Automata

      • Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina
      Pages 143-153

    11. A Note on Square-Free Shuffles of Words

      • Tero Harju
      Pages 154-160

    12. Strongly k-Abelian Repetitions

      • Mari Huova, Aleksi Saarela
      Pages 161-168

    13. Similarity Relations and Repetition-Freeness

      • Tomi Kärki
      Pages 169-180
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 9th International Conference on Combinatorics on Words, WORDS 2013, held in Turku, Finland, in September 2013 under the auspices of the EATCS. The 20 revised full papers presented were carefully reviewed and selected from 43 initial submissions. The central topic of the conference is combinatorics on words (i.e. the study of finite and infinite sequence of symbols) from varying points of view, including their combinatorial, algebraic and algorithmic aspects, as well as their applications.

Editors and Affiliations

  • Department of Mathematics and TUCS, University of Turku, Turku, Finland

    Juhani Karhumäki

  • University of Turku, Turku, Finland

    Arto Lepistö

  • FUNDIM, University of Turku, Finland

    Luca Zamboni

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation