Coverart for item
The Resource Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings, Juhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.)

Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings, Juhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.)

Label
Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings
Title
Combinatorics on words
Title remainder
9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings
Statement of responsibility
Juhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
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
Member of
Cataloging source
HUA
Illustrations
illustrations
Index
index present
LC call number
QA164
LC item number
.C6642 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
International Conference on Combinatorics on Words
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1962-
http://library.link/vocab/relatedWorkOrContributorName
  • Karhumäki, Juhani
  • Lepistö, Arto
  • Zamboni, Luca
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8079
http://library.link/vocab/subjectName
  • Combinatorial analysis
  • Word problems (Mathematics)
Label
Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings, Juhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.)
Instantiates
Publication
Copyright
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier.
Content category
text
Content type code
txt
Content type MARC source
rdacontent.
Contents
  • Non-constructive methods for avoiding repetitions in words
  • Narad Rampersad
  • Words, trees and automata minimization
  • Giusi Castiglione and Marinella Sciortino
  • Contributions. Auto-similarity in rational base number systems
  • Shigeki Akiyama, Victor Marsault, and Jacques Sakarovitch
  • Inifinite words with well distributed occurences
  • Ľubomíra Balková, Michelangelo Bucci, Alessandro De Luca, and Svetlana Puzymina
  • Generating discrete planes with substitutions
  • Valérie Berthé, Jérémie Bourdon, Timo Jolivet, and Anne Siegel
  • Part 1. Invited. Which Arnoux-Rauzy words are 2-balanced?
  • Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
  • Valérie Berthé and Sebastien Labbé
  • The lexicographic cross-section of the plactic monoid is regular
  • Christian Choffrut and Robert Mercaş
  • Suffix conjugates for a class of morphic subshifts (extended abstract)
  • James D. Currie, Narad Rampersad, and Kalle Saari
  • Periodicity forcing words
  • Joel D. Day, Daniel Reidenbach, and Johannes C. Schneider
  • Balancedness of Arnoux-Rauzy and Brun words
  • Vincent Delecroix, Tomás Hejda, and Wolfgang Steiner
  • Julien Cassaigne
  • Open and closed prefixes of Sturmian words
  • Alessandra De Luca and Gabriele Fici
  • Finitely generated ideal languages and synchronizing automata
  • Vladimir V. Gusev, Marina I. Maslennikova, and Elena V. Pribavkina
  • A note on square-free shuffles of words
  • Tero Harju
  • Strongly k-Abelian repetitions
  • Mari Huova and Aleksi Saarela
  • Similarity relations and repetition-freeness
  • Tomi Kärki
  • Dynamical equivalence of morphisms
  • On quasiperiodic morphisms
  • Florence Levé and Gwénaël Richomme
  • Enumerating abelian returns to prefixes of Sturmian words
  • Zuzana Masáková and Edita Pelantová
  • Regular ideal languages and synchronizing automata
  • Rogério Reis and Emanuele Rodaro
  • Another generalization of Abelian equivalence: binomial complexity of infinite words
  • / Michel Rigo and Pavel Salimov
  • Weekly unambiguous morphisms with respect to sets of patterns with constants
  • Aleksi Saarela
  • Michel Dekking
  • On infinite words determined by L systems
  • Tim Smith
  • Sets represented as length-n factors of a word
  • Shuo Tqan and Jeffrey Shallit
  • Deterministic semi-thue systems and variants of post correspondence problem
  • Vesa Halava
  • Subword complexity in free groups
  • Gilbert Levitt
Control code
861569918
Dimensions
24 cm
Extent
x, 261 pages
Isbn
9783642405785
Media category
unmediated
Media MARC source
rdamedia.
Media type code
n
Other physical details
illustrations
System control number
(OCoLC)861569918
Label
Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings, Juhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.)
Publication
Copyright
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier.
Content category
text
Content type code
txt
Content type MARC source
rdacontent.
Contents
  • Non-constructive methods for avoiding repetitions in words
  • Narad Rampersad
  • Words, trees and automata minimization
  • Giusi Castiglione and Marinella Sciortino
  • Contributions. Auto-similarity in rational base number systems
  • Shigeki Akiyama, Victor Marsault, and Jacques Sakarovitch
  • Inifinite words with well distributed occurences
  • Ľubomíra Balková, Michelangelo Bucci, Alessandro De Luca, and Svetlana Puzymina
  • Generating discrete planes with substitutions
  • Valérie Berthé, Jérémie Bourdon, Timo Jolivet, and Anne Siegel
  • Part 1. Invited. Which Arnoux-Rauzy words are 2-balanced?
  • Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
  • Valérie Berthé and Sebastien Labbé
  • The lexicographic cross-section of the plactic monoid is regular
  • Christian Choffrut and Robert Mercaş
  • Suffix conjugates for a class of morphic subshifts (extended abstract)
  • James D. Currie, Narad Rampersad, and Kalle Saari
  • Periodicity forcing words
  • Joel D. Day, Daniel Reidenbach, and Johannes C. Schneider
  • Balancedness of Arnoux-Rauzy and Brun words
  • Vincent Delecroix, Tomás Hejda, and Wolfgang Steiner
  • Julien Cassaigne
  • Open and closed prefixes of Sturmian words
  • Alessandra De Luca and Gabriele Fici
  • Finitely generated ideal languages and synchronizing automata
  • Vladimir V. Gusev, Marina I. Maslennikova, and Elena V. Pribavkina
  • A note on square-free shuffles of words
  • Tero Harju
  • Strongly k-Abelian repetitions
  • Mari Huova and Aleksi Saarela
  • Similarity relations and repetition-freeness
  • Tomi Kärki
  • Dynamical equivalence of morphisms
  • On quasiperiodic morphisms
  • Florence Levé and Gwénaël Richomme
  • Enumerating abelian returns to prefixes of Sturmian words
  • Zuzana Masáková and Edita Pelantová
  • Regular ideal languages and synchronizing automata
  • Rogério Reis and Emanuele Rodaro
  • Another generalization of Abelian equivalence: binomial complexity of infinite words
  • / Michel Rigo and Pavel Salimov
  • Weekly unambiguous morphisms with respect to sets of patterns with constants
  • Aleksi Saarela
  • Michel Dekking
  • On infinite words determined by L systems
  • Tim Smith
  • Sets represented as length-n factors of a word
  • Shuo Tqan and Jeffrey Shallit
  • Deterministic semi-thue systems and variants of post correspondence problem
  • Vesa Halava
  • Subword complexity in free groups
  • Gilbert Levitt
Control code
861569918
Dimensions
24 cm
Extent
x, 261 pages
Isbn
9783642405785
Media category
unmediated
Media MARC source
rdamedia.
Media type code
n
Other physical details
illustrations
System control number
(OCoLC)861569918

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...