default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th WORDS 2011: Prague, Czech Republic
- Petr Ambroz, Stepan Holub, Zuzana Masáková:
Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011. EPTCS 63, 2011 - Srecko Brlek:
Interactions between Digital Geometry and Combinatorics on Words. 1-12 - Anna E. Frid:
Infinite permutations vs. infinite words. 13-19 - Juha Kortelainen:
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions. 22-29 - Benoît Rittaud, Laurent Vivier:
Circular words and applications. 31-36 - Golnaz Badkobeh, Maxime Crochemore:
Finite-Repetition threshold for infinite ternary words. 37-43 - Valérie Berthé, Sébastien Labbé:
Uniformly balanced words with linear complexity and prescribed letter frequencies. 44-52 - Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
Pattern 1^j0^i avoiding binary words. 53-64 - Bastian Bischoff, Dirk Nowotka:
Pattern Avoidability with Involution. 65-70 - Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich:
Recurrent Partial Words. 71-82 - Fabio Burderi:
Monoids and Maximal Codes. 83-92 - Michaël Cadilhac
, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. 93-102 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
From Regular to Strictly Locally Testable Languages. 103-111 - Daniel Dombek:
Substitutions over infinite alphabet generating (-β)-integers. 115-121 - Sébastien Ferenczi:
Dynamical generalizations of the Lagrange spectrum. 122-128 - Gabriele Fici:
A Classification of Trapezoidal Words. 129-137 - Irina A. Gorbunova, Arseny M. Shur:
On Pansiot Words Avoiding 3-Repetitions. 138-146 - Vesa Halava, Tero Harju, Tomi Kärki:
A new proof for the decidability of D0L ultimate periodicity. 147-151 - Thierry Monteil:
The complexity of tangent words. 152-157 - Hossein Nevisi, Daniel Reidenbach:
Unambiguous 1-Uniform Morphisms. 158-167 - Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Binary Cube-free Words of Any Level. 168-178 - Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. 179-188 - Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur:
Fife's Theorem for (7/3)-Powers. 189-198 - Mathieu Roux, Brigitte Vallée:
Information theory: Sources, Dirichlet series, and realistic analyses of data structures. 199-214 - Aleksi Saarela:
Systems of Word Equations and Polynomials: a New Approach. 215-225 - Matthew J. Samuel:
Word posets, with applications to Coxeter groups. 226-230 - Jeffrey O. Shallit:
The Critical Exponent is Computable for Automatic Sequences. 231-239 - Nikita Sidorov:
Optimizing Properties of Balanced Words. 240-246 - Wolfgang Steiner:
On the Delone property of (-β)-integers. 247-256 - Alexandr Valyuzhenich:
Permutation complexity of the fixed points of some uniform binary morphisms. 257-264 - Steven Widmer:
Permutation Complexity Related to the Letter Doubling Map. 265-276
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-19 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
