Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Klouda Karel"'
The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of that clas
Externí odkaz:
http://arxiv.org/abs/2409.06849
Autor:
Suchankova Jana, Roupcova Petra, Suranova Kamila, Klouda Karel, Krocova Sarka, Slany Jan, Tesarova Sandra
Publikováno v:
E3S Web of Conferences, Vol 436, p 10013 (2023)
This paper provides an introduction to the problem of the occurrence of some groups of micropollutants in wastewater, namely pharmaceutically active compounds (PhAC) and drugs in the context of wastewater treatment in Ostrava (290,000 inhabitants). W
Externí odkaz:
https://doaj.org/article/5ac77c86ff3745afbfb5c5842dd35476
Autor:
Klouda, Karel, Starosta, Štěpán
Publikováno v:
In Journal of Combinatorial Theory, Series A August 2024 206
Autor:
Klouda, Karel, Starosta, Štěpán
Publikováno v:
Journal of Combinatorial Theory, Series A, 206, 105904, 2024
Let $H$ be an HD0L-system. We show that there are only finitely many primitive words $v$ with the property that $v^k$, for all integers $k$, is an element of the factorial language of $H$. In particular, this result applies to the set of all factors
Externí odkaz:
http://arxiv.org/abs/2108.11279
Publikováno v:
Theoretical Computer Science, Volume 743, 2018, Pages 23-37, ISSN 0304-3975
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word $d_{\bf u}(w)
Externí odkaz:
http://arxiv.org/abs/1801.09203
Autor:
Bimová, Paula, Roupcová, Petra, Klouda, Karel, Matějová, Lenka, Staňová, Andrea Vojs, Grabicová, Kateřina, Grabic, Roman, Majová, Veronika, Híveš, Ján, Špalková, Viera, Gemeiner, Pavol, Celec, Peter, Konečná, Barbora, Bírošová, Lucia, Krahulcová, Monika, Mackuľak, Tomáš
Publikováno v:
In Journal of Environmental Chemical Engineering August 2021 9(4)
Publikováno v:
Proceedings of the International Multidisciplinary Scientific GeoConference SGEM. 2023, Vol. 23, p77-85. 9p.
Autor:
Klouda, Karel, Medková, Kateřina
Publikováno v:
Theoretical Computer Science, 615 (2016), 12-22
Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upp
Externí odkaz:
http://arxiv.org/abs/1507.05223
Autor:
Klouda, Karel, Starosta, Štěpán
We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and S\'e\'ebold, however their proof is only a sketch. We give here a complete proof. Further, employing our previ
Externí odkaz:
http://arxiv.org/abs/1401.0038
Autor:
Klouda, Karel, Starosta, Štěpán
Publikováno v:
Journal of Discrete Algorithms, 33 (2015), 130-138
We describe a simple algorithm which, for a given D0L system, returns all factors $v$ such that $v^k$ is in the language of the system for all $k$. This algorithm can be used to decide whether a D0L system is repetitive.
Comment: 10 pages, one f
Comment: 10 pages, one f
Externí odkaz:
http://arxiv.org/abs/1307.6408