000 06615cam a2200877 i 4500
001 ocn858918961
003 OCoLC
005 20250703162837.0
006 m o d
007 cr cnu|||unuuu
008 130925s2013 gw a ob 101 0 eng d
040 _aGW5XE
_beng
_erda
_epn
_cGW5XE
_dYDXCP
_dNLGGC
_dOCLCO
_dCOO
_dZMC
_dOHS
_dOHI
_dOCLCO
_dOCLCF
_dOCLCQ
_dOCLCO
_dOCL
_dGW5XE
_dOCLCO
_dEBLCP
_dOCLCQ
_dOCLCO
_dDIBIB
_dOCLCO
_dJG0
_dMERER
_dDGU
_dESU
_dOCLCQ
_dU3G
_dIOG
_dOCLCO
_dOCLCA
_dBUF
_dOCLCO
_dCEF
_dOCLCQ
_dU3W
_dAU@
_dOCLCO
_dWYU
_dYOU
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCLCA
_dOCLCQ
_dOCLCA
_dAJS
_dUKAHL
_dOCLCO
_dCOM
_dOCLCO
_dOCL
_dOCLCQ
_dOCLCO
_dOCLCL
_dOCLCQ
_dOCLCL
019 _a858942946
020 _a9783642405792
_q(electronic bk.)
020 _a3642405797
_q(electronic bk.)
020 _z3642405789
_q(print)
020 _z9783642405785
_q(print)
020 _z9783642405785
024 7 _a10.1007/978-3-642-40579-2
_2doi
029 1 _aAU@
_b000052282449
029 1 _aCHBIS
_b009971957
029 1 _aCHVBK
_b302649441
029 1 _aNLGGC
_b364465867
029 1 _aNZ1
_b15293545
035 _a(OCoLC)858918961
_z(OCoLC)858942946
050 4 _aQA164
_b.I58 2013
060 4 _aQA 164
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a511/.6
_223
049 _aMAIN
111 2 _aWORDS (Conference)
_n(9th :
_d2013 :
_cTurku, Finland)
_949974
245 1 0 _aCombinatorics on words :
_b9th international conference, WORDS 2013, Turku, Finland, September 16-20, 2013 : proceedings /
_cJuhani Karhumäki, Arto Lepistö, Luca Zamboni (eds.).
264 1 _aHeidelberg :
_bSpringer,
_c[2013]
264 4 _c©2013
300 _a1 online resource (x, 263 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture notes in computer science,
_x0302-9743 ;
_v8079
505 0 0 _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 /
_rĹubomíra Balková ... et al. --
_tGenerating Discrete Planes with Substitutions /
_rValérie Berthé ... et al. --
_tConvergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm /
_rValérie Berthé and Sebastien Labbé --
_tThe Lexicographic Cross-Section of the Plactic Monoid Is Regular /
_rChristian Choffrut and Robert Mercaş --
_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, Tomáš 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 Kärki --
_tOn Quasiperiodic Morphisms /
_rFlorence Levé and Gwénaël Richomme --
_tEnumerating Abelian Returns to Prefixes of Sturmian Words /
_rZuzana Masáková and Edita Pelantová --
_tRegular Ideal Languages and Synchronizing Automata /
_rRogério 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.
588 0 _aOnline resource; title from PDF title page (SpringerLink, viewed September 25, 2013).
504 _aIncludes bibliographical references and index.
520 _aThis 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.
650 0 _aCombinatorial analysis
_vCongresses.
_915000
650 0 _aWord problems (Mathematics)
_vCongresses.
_938466
650 0 _aMathematics.
650 2 _aSoftware
_916724
650 2 _aMathematics
650 6 _aAnalyse combinatoire
_vCongrès.
_918518
650 6 _aProblèmes des mots (Mathématiques)
_vCongrès.
_9967412
650 6 _aLogiciels.
_926065
650 6 _aMathématiques.
_970699
650 7 _asoftware.
_2aat
_916724
650 7 _aMathematics
_2fast
650 7 _aCombinatorial analysis
_2fast
_95330
650 7 _aWord problems (Mathematics)
_2fast
_938468
655 2 _aCongress
_911670
655 7 _aproceedings (reports)
_2aat
655 7 _aConference papers and proceedings
_2fast
_96065
655 7 _aConference papers and proceedings.
_2lcgft
_96065
655 7 _aActes de congrès.
_2rvmgf
_9609890
700 1 _aKarhumäki, Juhani,
_eeditor.
_919694
700 1 _aLepistö, Arto,
_eeditor.
_922121
700 1 _aZamboni, Luca,
_d1962-
_eeditor.
_1https://id.oclc.org/worldcat/entity/E39PCjJ77t7vPq8WMGCtFHjgrq
_949976
758 _ihas work:
_aCombinatorics on words (Text)
_1https://id.oclc.org/worldcat/entity/E39PCH3HDypqJrghB9cQkV4bYd
_4https://id.oclc.org/worldcat/ontology/hasWork
776 0 8 _iPrinted edition:
_z9783642405785
830 0 _aLecture notes in computer science ;
_v8079.
856 4 0 _uhttps://link.springer.com/10.1007/978-3-642-40579-2
938 _aAskews and Holts Library Services
_bASKH
_nAH28966260
938 _aProQuest Ebook Central
_bEBLB
_nEBL3093436
938 _aYBP Library Services
_bYANK
_n11118808
994 _a92
_bATIST
999 _c643005
_d643005