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.

LEADER 00000cam  2200721Ii 4500 
001    858918961 
003    OCoLC 
005    20181101045316.6 
006    m     o  d         
007    cr cnu|||unuuu 
008    130925s2013    gw a    ob    101 0 eng d 
010    2013946036 
019    858942946 
020    9783642405792|q(electronic bk.) 
020    3642405797|q(electronic bk.) 
020    |z3642405789|q(print) 
020    |z9783642405785|q(print) 
020    |z9783642405785 
024 7  10.1007/978-3-642-40579-2|2doi 
035    (OCoLC)858918961|z(OCoLC)858942946 
040    GW5XE|beng|erda|epn|cGW5XE|dYDXCP|dNLGGC|dOCLCO|dCOO|dZMC
049    MAIN 
050  4 QA164|b.I58 2013 
060  4 QA 164 
072  7 UY|2bicssc 
072  7 UYA|2bicssc 
072  7 COM014000|2bisacsh 
072  7 COM031000|2bisacsh 
082 04 511/.6|223 
111 2  WORDS (Conference)|n(9th :|d2013 :|cTurku, Finland)|0http:
245 10 Combinatorics on words :|b9th international conference, 
       WORDS 2013, Turku, Finland, September 16-20, 2013 : 
       proceedings /|cJuhani Karhumaki, Arto Lepisto, Luca 
       Zamboni (eds.). 
264  1 Heidelberg :|bSpringer,|c[2013] 
264  4 |c2013 
300    1 online resource (x, 263 pages) :|billustrations. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gpolychrome|2rdacc|0
347    text file|2rdaft|0
490 1  Lecture notes in computer science,|x0302-9743 ;|v8079 
504    Includes bibliographical references and index. 
505 00 |tInvited.|tWhich Arnoux-Rauzy Words Are 2-Balanced? /
       |rJulien Cassaigne --|tDynamical Equivalence of Morphisms 
       /|rMichel Dekking --|tDeterministic Semi-Thue Systems and 
       Variants of Post Correspondence Problem /|rVesa Halava --
       |tSubword Complexity in Free Groups /|rGilbert Levitt --
       |tNon-constructive Methods for Avoiding Repetitions in 
       Words /|rNarad Rampersad --|tWords, Trees and Automata 
       Minimization /|rGiusi Castiglione and Marinella Sciortino 
       --|tContributions.|tAuto-similarity in Rational Base 
       Number Systems /|rShigeki Akiyama, Victor Marsault and 
       Jacques Sakarovitch --|tInfinite Words with Well 
       Distributed Occurrences /|rLubomira Balkova ... et al. --
       |tGenerating Discrete Planes with Substitutions /|rValerie
       Berthe ... et al. --|tConvergence and Factor Complexity 
       for the Arnoux-Rauzy-Poincare Algorithm /|rValerie Berthe 
       and Sebastien Labbe --|tThe Lexicographic Cross-Section of
       the Plactic Monoid Is Regular /|rChristian Choffrut and 
       Robert Mercas --|tSuffix Conjugates for a Class of Morphic
       Subshifts /|rJames D. Currie, Narad Rampersad and Kalle 
       Saari --|tPeriodicity Forcing Words /|rJoel D. Day, Daniel
       Reidenbach and Johannes C. Schneider --|tBalancedness of 
       Arnoux-Rauzy and Brun Words /|rVincent Delecroix, Tomas 
       Hejda and Wolfgang Steiner --|tOpen and Closed Prefixes of
       Sturmian Words /|rAlessandro De Luca and Gabriele Fici --
       |tFinitely Generated Ideal Languages and Synchronizing 
       Automata /|rVladimir V. Gusev, Marina I. Maslennikova and 
       Elena V. Pribavkina --|tA Note on Square-Free Shuffles of 
       Words /|rTero Harju --|tStrongly k-Abelian Repetitions /
       |rMari Huova and Aleksi Saarela --|tSimilarity Relations 
       and Repetition-Freeness /|rTomi Karki --|tOn Quasiperiodic
       Morphisms /|rFlorence Leve and Gwenael Richomme --
       |tEnumerating Abelian Returns to Prefixes of Sturmian 
       Words /|rZuzana Masakova and Edita Pelantova --|tRegular 
       Ideal Languages and Synchronizing Automata /|rRogerio Reis
       and Emanuele Rodaro --|tAnother Generalization of Abelian 
       Equivalence: Binomial Complexity of Infinite Words /
       |rMichel Rigo and Pavel Salimov --|tWeakly Unambiguous 
       Morphisms with Respect to Sets of Patterns with Constants 
       /|rAleksi Saarela --|tOn Infinite Words Determined by L 
       Systems /|rTim Smith --|tSets Represented as the Length-n 
       Factors of a Word /|rShuo Tan and Jeffrey Shallit. 
520    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. 
588 0  Online resource; title from PDF title page (SpringerLink, 
       viewed September 25, 2013). 
650  0 Combinatorial analysis|vCongresses.|0
650  0 Word problems (Mathematics)|0
650  2 Software.|0 
650  2 Mathematics.|0 
655  2 Congress.|0 
655  4 Electronic books. 
655  4 Ebook. 
655  7 Conference papers and proceedings.|2fast|0http:// 
655  7 Conference papers and proceedings.|2lcgft|0http:// 
700 1  Karhumäki, Juhani,|0
700 1  Lepistö, Arto,|0
700 1  Zamboni, Luca,|d1962-|0
776 08 |iPrinted edition:|z9783642405785 
830  0 Lecture notes in computer science ;|0
990    SpringerLink|bSpringer English/International eBooks 2013 -
       Full Set|c2018-10-31|yNew collection 
View online

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