Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Mathematics of computing → Combinatorics on words"'
Autor:
Richomme, Gwenaël, Rosenfeld, Matthieu
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word w of length n over an alphabet of cardinality k, w can be reconstructed from the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ddf9b607661e147e98ef45c95cf14f0
http://arxiv.org/abs/2301.01571
http://arxiv.org/abs/2301.01571
Autor:
Bulteau, Laurent, Lipták, Zsuzsanna
LIPIcs, Volume 259, CPM 2023, Complete Volume
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8239b9890ef3ece0d51fe9454979140
Autor:
Bulteau, Laurent, Lipták, Zsuzsanna
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 0:i-0:xvi
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 0:i-0:xvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0d916bec0defafb7a65b516dd27489d
Autor:
Navarro, Gonzalo, Urbina, Cristian
In order to use them for compression, we extend L-systems (without ε-rules) with two parameters d and n, and also a coding τ, which determines unambiguously a string w = τ(φ^d(s))[1:n], where φ is the morphism of the system, and s is its axiom.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e514cfad93cc2d90f959745084f28cd6
Morphisms are widely studied combinatorial objects that can be used for generating infinite families of words. In the context of Information theory, injective morphisms are called (variable length) codes. In Data compression, the morphisms, combined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40c05defe104123912d1493b72c78def
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th term of the $\ell$-boundary sequence of an infinite word is the finite set of pairs $(u,v)$ of prefixes and suffixes of length $\ell$ appearing in factors $uyv$ of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01156528a7f57244a646bb236e9bd4be
http://arxiv.org/abs/2206.15319
http://arxiv.org/abs/2206.15319
Autor:
Machacek, John
Walnut is a software that using automata can prove theorems in combinatorics on words about automatic sequences. We are able to apply this software to both prove new results as well as reprove some old results on avoiding squares and cubes in partial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6396e47e8da2f98546039fc3f5f892f
http://arxiv.org/abs/2201.05954
http://arxiv.org/abs/2201.05954
A Lyndon word is a word that is lexicographically smaller than all of its non-trivial rotations (e.g. ananas is a Lyndon word; banana is not a Lyndon word due to its smaller rotation abanan). The Lyndon forest (or equivalently Lyndon table) identifie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edb1cfd87edd44c4c806e41a889413c0
Grammar-based compression is a loss-less data compression scheme that represents a given string w by a context-free grammar that generates only w. While computing the smallest grammar which generates a given string w is NP-hard in general, a number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b10a9523aede52f93ae266a7190ab2ac
Autor:
Shallit, Jeffrey
The first-order theory of automatic sequences with addition is decidable, and this means that one can often prove combinatorial properties of these sequences "automatically", using the free software Walnut written by Hamoon Mousavi. In this talk I wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::465f96c951a2287543f313994c7ce2af