Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Élise Vandomme"'
This book constitutes the refereed proceedings of the 11th International Conference on Combinatorics on Words, WORDS 2017, held in Montréal, QC, Canada, in September 2017. The 21 revised full papers presented together with 5invoted talks were carefu
Autor:
Élise Vandomme, Lama Tarsissi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319663951
Combinatorics on Words
Combinatorics on Words
Digital convex (DC) sets plays a prominent role in the framework of digital geometry providing a natural generalization to the concept of Euclidean convexity when we are dealing with polyominoes, i.e., finite and connected sets of points. A result by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c52088d28bcb625b0bdeaca0f3fedaa
https://doi.org/10.1007/978-3-319-66396-8
https://doi.org/10.1007/978-3-319-66396-8
Autor:
Matthieu Rosenfeld, Pascal Ochem
Publikováno v:
11th International Conference on Combinatorics on Words
WORDS
WORDS, Sep 2017, Montreal, Canada. pp.30-35, ⟨10.1007/978-3-319-66396-8_4⟩
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩
Lecture Notes in Computer Science ISBN: 9783319663951
The Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩
WORDS
WORDS, Sep 2017, Montreal, Canada. pp.30-35, ⟨10.1007/978-3-319-66396-8_4⟩
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩
Lecture Notes in Computer Science ISBN: 9783319663951
The Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩
We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula $ABCAB.ABCBA.ACB.BAC$ (resp. $ABCA.BCAB.BCB.CBA$) have the same set of recurrent factors as t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3893c0769ae4fd92076a8f512254d99b
https://doi.org/10.37236/7901
https://doi.org/10.37236/7901
Publikováno v:
Combinatorics on words
Srečko Brlek; Francesco Dolce; Christophe Reutenauer; Élise Vandomme. Combinatorics on words, 10432, Springer, pp.157-163, 2017, Lecture Notes in Computer Science, 978-3-319-66395-1. ⟨10.1007/978-3-319-66396-8_15⟩
Lecture Notes in Computer Science ISBN: 9783319663951
WORDS
Srečko Brlek; Francesco Dolce; Christophe Reutenauer; Élise Vandomme. Combinatorics on words, 10432, Springer, pp.157-163, 2017, Lecture Notes in Computer Science, 978-3-319-66395-1. ⟨10.1007/978-3-319-66396-8_15⟩
Lecture Notes in Computer Science ISBN: 9783319663951
WORDS
11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings; International audience; The complexity function of an infinite word counts the number of its factors. For any positive function f , its exponential
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65cd6e31a4b7392de1f436bb064640d3
https://hal.archives-ouvertes.fr/hal-02120194/file/fmmwords.pdf
https://hal.archives-ouvertes.fr/hal-02120194/file/fmmwords.pdf