Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
EBOOK
Conference WORDS (Conference) (9th : 2013 : Turku, Finland)
Title Combinatorics on words : 9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings / Juhani Karhumaki, Arto Lepisto, Luca Zamboni (eds.).
Imprint Heidelberg : Springer, [2013]
2013

LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference WORDS (Conference) (9th : 2013 : Turku, Finland)
Series Lecture notes in computer science, 0302-9743 ; 8079
Lecture notes in computer science ; 8079.
Subject Combinatorial analysis -- Congresses.
Word problems (Mathematics) -- Congresses.
Software.
Mathematics.
Alt Name Karhumäki, Juhani,
Lepistö, Arto,
Zamboni, Luca, 1962-
Description 1 online resource (x, 263 pages) : illustrations.
polychrome rdacc
Contents Invited. Which Arnoux-Rauzy Words Are 2-Balanced? / Julien Cassaigne -- Dynamical Equivalence of Morphisms / Michel Dekking -- Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem / Vesa Halava -- Subword Complexity in Free Groups / Gilbert Levitt -- 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 -- Infinite Words with Well Distributed Occurrences / Lubomira Balkova ... et al. -- Generating Discrete Planes with Substitutions / Valerie Berthe ... et al. -- Convergence and Factor Complexity for the Arnoux-Rauzy-Poincare Algorithm / Valerie Berthe and Sebastien Labbe -- The Lexicographic Cross-Section of the Plactic Monoid Is Regular / Christian Choffrut and Robert Mercas -- Suffix Conjugates for a Class of Morphic Subshifts / 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, Tomas Hejda and Wolfgang Steiner -- Open and Closed Prefixes of Sturmian Words / Alessandro 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 Karki -- On Quasiperiodic Morphisms / Florence Leve and Gwenael Richomme -- Enumerating Abelian Returns to Prefixes of Sturmian Words / Zuzana Masakova and Edita Pelantova -- Regular Ideal Languages and Synchronizing Automata / Rogerio Reis and Emanuele Rodaro -- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words / Michel Rigo and Pavel Salimov -- Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants / Aleksi Saarela -- On Infinite Words Determined by L Systems / Tim Smith -- Sets Represented as the Length-n Factors of a Word / Shuo Tan and Jeffrey Shallit.
Bibliography Note Includes bibliographical references and index.
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.
Note Online resource; title from PDF title page (SpringerLink, viewed September 25, 2013).
ISBN 9783642405792 (electronic bk.)
3642405797 (electronic bk.)
3642405789 (print)
9783642405785 (print)
9783642405785
ISBN/ISSN 10.1007/978-3-642-40579-2
OCLC # 858918961
Additional Format Printed edition: 9783642405785


If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team