Sequences with constant number of return words - L'ubomíra Balková; Edita Pelantová; Wolfgang Steiner (CoRR, 2006)

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers. - L'ubomíra Balková; Edita Pelantová; Ondrej Turek (RAIRO Theor. Informatics Appl., 2007)

Palindromic complexity of infinite words associated with non-simple Parry numbers. - L'ubomíra Balková; Zuzana Masáková (RAIRO Theor. Informatics Appl., 2009)

Palindromes in infinite ternary words. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (RAIRO Theor. Informatics Appl., 2009)

A note on symmetries in the Rauzy graph and factor frequencies. - L'ubomíra Balková; Edita Pelantová (Theor. Comput. Sci., 2009)

Sturmian jungle (or garden?) on multiliteral alphabets. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (RAIRO Theor. Informatics Appl., 2010)

Infinite words with finite defect. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Adv. Appl. Math., 2011)

Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers. - L'ubomíra Balková; Karel Klouda; Edita Pelantová (Integers, 2011)

Abelian complexity of infinite words associated with quadratic Parry numbers. - L'ubomíra Balková; Karel Brinda; Ondrej Turek (Theor. Comput. Sci., 2011)

On Brlek-Reutenauer conjecture. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2011)

Factor Frequencies in Languages Invariant Under Symmetries Preserving Factor Frequencies. - L'ubomíra Balková (Integers, 2012)

Factor frequencies in generalized Thue-Morse words. - L'ubomíra Balková (Kybernetika, 2012)

Corrigendum: "On Brlek-Reutenauer conjecture". - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2012)

Infinite Words with Well Distributed Occurrences. - L'ubomíra Balková; Michelangelo Bucci; Alessandro De Luca 002; Svetlana Puzynina (WORDS, 2013)

Proof of the Brlek-Reutenauer conjecture. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2013)

On Periodicity of Generalized Pseudostandard Words. - Josef Florian; L'ubomíra Dvoráková (Electron. J. Comb., 2016)

Aperiodic pseudorandom number generators based on infinite words. - L'ubomíra Balková; Michelangelo Bucci; Alessandro De Luca 002; Jirí Hladký; Svetlana Puzynina (Theor. Comput. Sci., 2016)

A New Estimate on Complexity of Binary Generalized Pseudostandard Words. - Josef Florian; L'ubomíra Dvoráková (Integers, 2017)

Fixed Points of Morphisms Among Binary Generalized Pseudostandard Words. - Tereza Velká; L'ubomíra Dvoráková (Integers, 2018)

Normalization of ternary generalized pseudostandard words. - Josef Florian; Tereza Veselá; L'ubomíra Dvoráková (Theor. Comput. Sci., 2019)

Complementary symmetric Rote sequences: the critical exponent and the recurrence function. - L'ubomíra Dvoráková; Katerina Medková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 2020)

Computation of Critical Exponent in Balanced Sequences. - Francesco Dolce; L'ubomíra Dvoráková; Edita Pelantová (WORDS, 2021)

On Balanced Sequences and Their Asymptotic Critical Exponent. - Francesco Dolce; L'ubomíra Dvoráková; Edita Pelantová (LATA, 2021)

On minimal critical exponent of balanced sequences. - L'ubomíra Dvoráková; Edita Pelantová; Daniela Opocenská; Arseny M. Shur (Theor. Comput. Sci., 2022)

Asymptotic repetitive threshold of balanced sequences. - L'ubomíra Dvoráková; Daniela Opocenská; Edita Pelantová (Math. Comput., 2022)

Critical Exponents of Regular Arnoux-Rauzy Sequences. - L'ubomíra Dvoráková; Jana Lepsová (WORDS, 2023)

On a Class of 2-Balanced Sequences. - L'ubomíra Dvoráková; Martin Masek; Edita Pelantová (WORDS, 2023)

On balanced sequences and their critical exponent. - Francesco Dolce; L'ubomíra Dvoráková; Edita Pelantová (Theor. Comput. Sci., 2023)

Critical Exponent of Binary Words with Few Distinct Palindromes. - L'ubomíra Dvoráková; Pascal Ochem; Daniela Opocenská (Electron. J. Comb., 2024)

String attractors of Rote sequences. - L'ubomíra Dvoráková; Veronika Hendrychová (Discret. Math. Theor. Comput. Sci., 2024)

The repetition threshold of episturmian sequences. - L'ubomíra Dvoráková; Edita Pelantová (Eur. J. Comb., 2024)

An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence. - L'ubomíra Dvoráková; Edita Pelantová (Theor. Comput. Sci., 2024)

String attractors of episturmian sequences. - L'ubomíra Dvoráková (Theor. Comput. Sci., 2024)

2-Balanced Sequences Coding Rectangle Exchange Transformation. - L'ubomíra Dvoráková; Zuzana Masáková; Edita Pelantová (Theory Comput. Syst., 2024)

Symmetries of Rich Sequences with Minimum Critical Exponent. - L'ubomíra Dvoráková; Edita Pelantová (WORDS, 2025)

The asymptotic repetition threshold of sequences rich in palindromes. - L'ubomíra Dvoráková; Karel Klouda; Edita Pelantová (Eur. J. Comb., 2025)