Complexity of infinite words associated with beta-expansions. - Christiane Frougny; Zuzana Masáková; Edita Pelantová (RAIRO Theor. Informatics Appl., 2004)

Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. - Christiane Frougny; Zuzana Masáková; Edita Pelantová (RAIRO Theor. Informatics Appl., 2004)

Integers with a maximal number of Fibonacci representations. - Petra Kocábová; Zuzana Masáková; Edita Pelantová (RAIRO Theor. Informatics Appl., 2005)

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

Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base. - Petr Ambroz; Zuzana Masáková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 2007)

Infinite Special Branches in Words Associated with Beta-Expansions. - Christiane Frougny; Zuzana Masáková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 2007)

Ambiguity in the m-Bonacci Numeration System. - Petra Kocábová; Zuzana Masáková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 2007)

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)

Factor versus palindromic complexity of uniformly recurrent infinite words. - Peter Balázi; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2007)

On a class of infinite words with affine factor complexity. - Julien Bernat; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2007)

Matrices of 3-iet preserving morphisms. - Petr Ambroz; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2008)

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)

Relation between powers of factors and the recurrence function characterizing Sturmian words. - Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2009)

Morphisms fixing words associated with exchange of three intervals. - Petr Ambroz; Zuzana Masáková; Edita Pelantová (RAIRO Theor. Informatics Appl., 2010)

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

Infinite Words Rich and Almost Rich in Generalized Palindromes. - Edita Pelantová; Stepán Starosta (Developments in Language Theory, 2011)

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

On the number of factors in codings of three interval exchange. - Petr Ambroz; Anna E. Frid; Zuzana Masáková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 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)

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

Number representation using generalized (-beta)-transformation. - Daniel Dombek; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2011)

Parallel addition in non-standard numeration systems. - Christiane Frougny; Edita Pelantová; Milena Svobodová (Theor. Comput. Sci., 2011)

Note on powers in three interval exchange transformations. - Daniel Lenz; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2011)

Arithmetics in number systems with a negative base. - Zuzana Masáková; Edita Pelantová; Tomás Vávra (Theor. Comput. Sci., 2011)

Almost Rich Words as Morphic Images of Rich Words. - Edita Pelantová; Stepán Starosta (Int. J. Found. Comput. Sci., 2012)

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

Enumerating Abelian Returns to Prefixes of Sturmian Words. - Zuzana Masáková; Edita Pelantová (WORDS, 2013)

Balances of m-bonacci words. - Karel Brinda; Edita Pelantová; Ondrej Turek (CoRR, 2013)

Languages invariant under more symmetries: Overlapping factors versus palindromic richness. - Edita Pelantová; Stepán Starosta (Discret. Math., 2013)

Greedy and lazy representations in negative base systems. - Tomás Hejda; Zuzana Masáková; Edita Pelantová (Kybernetika, 2013)

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

Parallel algorithms for addition in non-standard number systems. - Christiane Frougny; Pavel Heller; Edita Pelantová; Milena Svobodová (ITA, 2014)

Balances of m-bonacci Words. - Karel Brinda; Edita Pelantová; Ondrej Turek (Fundam. Informaticae, 2014)

k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems. - Christiane Frougny; Pavel Heller; Edita Pelantová; Milena Svobodová (Theor. Comput. Sci., 2014)

Palindromic closures using multiple antimorphisms. - Tatiana Jajcayová; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2014)

Palindromic richness for languages invariant under more symmetries. - Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2014)

Interval Exchange Words and the Question of Hof, Knill, and Simon. - Zuzana Masáková; Edita Pelantová; Stepán Starosta (DLT, 2015)

Beta-representations of 0 and Pisot numbers. - Christiane Frougny; Edita Pelantová (CoRR, 2015)

On-line Multiplication and Division in Real and Complex Bases. - Marta Brzicova; Christiane Frougny; Edita Pelantová; Milena Svobodová (ARITH, 2016)

Constructions of words rich in palindromes and pseudopalindromes. - Edita Pelantová; Stepán Starosta (Discret. Math. Theor. Comput. Sci., 2016)

Palindromic sequences generated from marked morphisms. - Sébastien Labbé 001; Edita Pelantová (Eur. J. Comb., 2016)

Spectral properties of cubic complex Pisot units. - Tomás Hejda; Edita Pelantová (Math. Comput., 2016)

On Words with the Zero Palindromic Defect. - Edita Pelantová; Stepán Starosta (WORDS, 2017)

On the Zero Defect Conjecture. - Sébastien Labbé 001; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2017)

Exchange of three intervals: Substitutions and palindromicity. - Zuzana Masáková; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2017)

Fixed points of Sturmian morphisms and their derivated words. - Karel Klouda; Katerina Medková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2018)

On Palindromic Length of Sturmian Sequences. - Petr Ambroz; Edita Pelantová (DLT, 2019)

On-line algorithms for multiplication and division in real and complex numeration systems. - Christiane Frougny; Marta Pavelka; Edita Pelantová; Milena Svobodová (Discret. Math. Theor. Comput. Sci., 2019)

Derived sequences of complementary symmetric Rote sequences. - Katerina Medková; Edita Pelantová; Laurent Vuillon (RAIRO Theor. Informatics Appl., 2019)

Palindromic length of words and morphisms in class P. - Petr Ambroz; Ondrej Kadlec; Zuzana Masáková; Edita Pelantová (Theor. Comput. Sci., 2019)

On non-repetitive complexity of Arnoux-Rauzy words. - Katerina Medková; Edita Pelantová; Élise Vandomme (Discret. Appl. Math., 2020)

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)

Morphisms generating antipalindromic words. - Petr Ambroz; Zuzana Masáková; Edita Pelantová (Eur. J. Comb., 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 the Markov numbers: Fixed numerator, denominator, and sum conjectures. - Clément Lagisquet; Edita Pelantová; Sébastien Tavenas; Laurent Vuillon (Adv. Appl. Math., 2021)

On Sturmian substitutions closed under derivation. - Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2021)

Spectrum, algebraicity and normalization in alternate bases. - Émilie Charlier; Célia Cisternino; Zuzana Masáková; Edita Pelantová (CoRR, 2022)

On Morphisms Preserving Palindromic Richness. - Francesco Dolce; Edita Pelantová (Fundam. Informaticae, 2022)

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)

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

Rewriting Rules for Arithmetics in Alternate Base Systems. - Zuzana Masáková; Edita Pelantová; Katarína Studenicová (DLT, 2023)

From positional representation of numbers to positional representation of vectors. - Izabella Ingrid Farkas; Edita Pelantová; Milena Svobodová (CoRR, 2023)

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

On a faithful representation of Sturmian morphisms. - Jana Lepsová; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2023)

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)

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)