![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
L'ubomíra Dvoráková
Person information
- affiliation: Czech Technical University in Prague, Department of Mathematics, Czech Republic
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská:
Critical Exponent of Binary Words with Few Distinct Palindromes. Electron. J. Comb. 31(2) (2024) - [j25]L'ubomíra Dvoráková, Edita Pelantová:
The repetition threshold of episturmian sequences. Eur. J. Comb. 120: 104001 (2024) - [j24]L'ubomíra Dvoráková
:
String attractors of episturmian sequences. Theor. Comput. Sci. 986: 114341 (2024) - [j23]L'ubomíra Dvoráková
, Edita Pelantová:
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence. Theor. Comput. Sci. 995: 114490 (2024) - 2023
- [j22]Francesco Dolce
, L'ubomíra Dvoráková
, Edita Pelantová:
On balanced sequences and their critical exponent. Theor. Comput. Sci. 939: 18-47 (2023) - [c5]L'ubomíra Dvoráková, Jana Lepsová:
Critical Exponents of Regular Arnoux-Rauzy Sequences. WORDS 2023: 130-142 - [c4]L'ubomíra Dvoráková, Martin Masek, Edita Pelantová:
On a Class of 2-Balanced Sequences. WORDS 2023: 143-154 - [i6]L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská:
Critical exponent of binary words with few distinct palindromes. CoRR abs/2311.13003 (2023) - 2022
- [j21]L'ubomíra Dvoráková
, Daniela Opocenská, Edita Pelantová:
Asymptotic repetitive threshold of balanced sequences. Math. Comput. 92(341): 1403-1429 (2022) - [j20]L'ubomíra Dvoráková
, Edita Pelantová, Daniela Opocenská, Arseny M. Shur:
On minimal critical exponent of balanced sequences. Theor. Comput. Sci. 922: 158-169 (2022) - 2021
- [c3]Francesco Dolce, L'ubomíra Dvoráková
, Edita Pelantová:
Computation of Critical Exponent in Balanced Sequences. WORDS 2021: 78-90 - [c2]Francesco Dolce, L'ubomíra Dvoráková
, Edita Pelantová:
On Balanced Sequences and Their Asymptotic Critical Exponent. LATA 2021: 293-304 - [i5]Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
On balanced sequences and their critical exponent. CoRR abs/2108.07503 (2021) - 2020
- [j19]L'ubomíra Dvoráková, Katerina Medková, Edita Pelantová:
Complementary symmetric Rote sequences: the critical exponent and the recurrence function. Discret. Math. Theor. Comput. Sci. 22(1) (2020)
2010 – 2019
- 2019
- [j18]Josef Florian, Tereza Veselá, L'ubomíra Dvoráková
:
Normalization of ternary generalized pseudostandard words. Theor. Comput. Sci. 780: 29-53 (2019) - 2018
- [j17]Tereza Velká, L'ubomíra Dvoráková:
Fixed Points of Morphisms Among Binary Generalized Pseudostandard Words. Integers 18: A21 (2018) - 2017
- [j16]Josef Florian, L'ubomíra Dvoráková:
A New Estimate on Complexity of Binary Generalized Pseudostandard Words. Integers 17: A61 (2017) - 2016
- [j15]Josef Florian, L'ubomíra Dvoráková
:
On Periodicity of Generalized Pseudostandard Words. Electron. J. Comb. 23(1): 1 (2016) - [j14]L'ubomíra Balková
, Michelangelo Bucci, Alessandro De Luca
, Jirí Hladký, Svetlana Puzynina:
Aperiodic pseudorandom number generators based on infinite words. Theor. Comput. Sci. 647: 85-100 (2016) - 2013
- [j13]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475: 120-125 (2013) - [c1]L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca
, Svetlana Puzynina:
Infinite Words with Well Distributed Occurrences. WORDS 2013: 46-57 - [i4]L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Jirí Hladký, Svetlana Puzynina:
Aperiodic pseudorandom number generators based on infinite words. CoRR abs/1311.6002 (2013) - 2012
- [j12]L'ubomíra Balková:
Factor Frequencies in Languages Invariant Under Symmetries Preserving Factor Frequencies. Integers 12: A36 (2012) - [j11]L'ubomíra Balková:
Factor frequencies in generalized Thue-Morse words. Kybernetika 48(3): 371-385 (2012) - [j10]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465: 73-74 (2012) - [i3]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Proof of Brlek-Reutenauer conjecture. CoRR abs/1208.2505 (2012) - 2011
- [j9]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Infinite words with finite defect. Adv. Appl. Math. 47(3): 562-574 (2011) - [j8]L'ubomíra Balková, Karel Klouda, Edita Pelantová:
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers. Integers 11B: A1 (2011) - [j7]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412(41): 5649-5655 (2011) - [j6]L'ubomíra Balková, Karel Brinda
, Ondrej Turek:
Abelian complexity of infinite words associated with quadratic Parry numbers. Theor. Comput. Sci. 412(45): 6252-6260 (2011) - 2010
- [j5]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44(4): 443-470 (2010)
2000 – 2009
- 2009
- [j4]L'ubomíra Balková
, Zuzana Masáková:
Palindromic complexity of infinite words associated with non-simple Parry numbers. RAIRO Theor. Informatics Appl. 43(1): 145-163 (2009) - [j3]L'ubomíra Balková
, Edita Pelantová
, Stepán Starosta:
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43(4): 687-702 (2009) - [j2]L'ubomíra Balková
, Edita Pelantová
:
A note on symmetries in the Rauzy graph and factor frequencies. Theor. Comput. Sci. 410(27-29): 2779-2783 (2009) - 2007
- [j1]L'ubomíra Balková
, Edita Pelantová
, Ondrej Turek:
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers. RAIRO Theor. Informatics Appl. 41(3): 307-328 (2007) - 2006
- [i2]L'ubomíra Balková, Edita Pelantová, Ondrej Turek:
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers. CoRR abs/cs/0608065 (2006) - [i1]L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner:
Sequences with constant number of return words. CoRR abs/math/0608603 (2006)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint