Edita Pelantová

86 papers C 6Misc 1Journal 74Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
On two conjectures of Shallit about Thue-Morse-like sequences.
Eur. J. Comb.
L'ubomíra Dvoráková, Savinien Kreczman, Edita Pelantová
2026 J jnl
Parry condition, existence and uniqueness of alternate bases.
CoRR
Émilie Charlier, Savinien Kreczman, Zuzana Masáková, Edita Pelantová
2025 J jnl
On a sequence of Kimberling and its relationship to the Tribonacci word.
CoRR
L'ubomíra Dvoráková, Edita Pelantová, Jeffrey O. Shallit
2025 — conf
Symmetries of Rich Sequences with Minimum Critical Exponent.
WORDS
L'ubomíra Dvoráková, Edita Pelantová
2025 J jnl
The asymptotic repetition threshold of sequences rich in palindromes.
Eur. J. Comb.
L'ubomíra Dvoráková, Karel Klouda, Edita Pelantová
2024 J jnl
2-Balanced Sequences Coding Rectangle Exchange Transformation.
Theory Comput. Syst.
L'ubomíra Dvoráková, Zuzana Masáková, Edita Pelantová
2024 J jnl
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence.
Theor. Comput. Sci.
L'ubomíra Dvoráková, Edita Pelantová
2024 J jnl
The repetition threshold of episturmian sequences.
Eur. J. Comb.
L'ubomíra Dvoráková, Edita Pelantová
2023 J jnl
From positional representation of numbers to positional representation of vectors.
CoRR
Izabella Ingrid Farkas, Edita Pelantová, Milena Svobodová
2023 — conf
On a Class of 2-Balanced Sequences.
WORDS
L'ubomíra Dvoráková, Martin Masek, Edita Pelantová
2023 J jnl
On a faithful representation of Sturmian morphisms.
Eur. J. Comb.
Jana Lepsová, Edita Pelantová, Stepán Starosta
2023 J jnl
On balanced sequences and their critical exponent.
Theor. Comput. Sci.
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
2023 C conf
Rewriting Rules for Arithmetics in Alternate Base Systems.
DLT
Zuzana Masáková, Edita Pelantová, Katarína Studenicová
2022 J jnl
Asymptotic repetitive threshold of balanced sequences.
Math. Comput.
L'ubomíra Dvoráková, Daniela Opocenská, Edita Pelantová
2022 J jnl
On Morphisms Preserving Palindromic Richness.
Fundam. Informaticae
Francesco Dolce, Edita Pelantová
2022 J jnl
On a faithful representation of Sturmian morphisms.
CoRR
Jana Lepsová, Edita Pelantová, Stepán Starosta
2022 J jnl
On minimal critical exponent of balanced sequences.
Theor. Comput. Sci.
L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur
2022 J jnl
Spectrum, algebraicity and normalization in alternate bases.
CoRR
Émilie Charlier, Célia Cisternino, Zuzana Masáková, Edita Pelantová
2021 — conf
Computation of Critical Exponent in Balanced Sequences.
WORDS
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
2021 C conf
On Balanced Sequences and Their Asymptotic Critical Exponent.
LATA
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
2021 J jnl
On Sturmian substitutions closed under derivation.
Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2021 J jnl
On balanced sequences and their critical exponent.
CoRR
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
2021 J jnl
On the Markov numbers: Fixed numerator, denominator, and sum conjectures.
Adv. Appl. Math.
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, Laurent Vuillon
2020 J jnl
Complementary symmetric Rote sequences: the critical exponent and the recurrence function.
Discret. Math. Theor. Comput. Sci.
L'ubomíra Dvoráková, Katerina Medková, Edita Pelantová
2020 J jnl
Morphisms generating antipalindromic words.
Eur. J. Comb.
Petr Ambroz, Zuzana Masáková, Edita Pelantová
2020 J jnl
On morphisms preserving palindromic richness.
CoRR
Francesco Dolce, Edita Pelantová
2020 J jnl
On non-repetitive complexity of Arnoux-Rauzy words.
Discret. Appl. Math.
Katerina Medková, Edita Pelantová, Élise Vandomme
2019 J jnl
Derived sequences of complementary symmetric Rote sequences.
RAIRO Theor. Informatics Appl.
Katerina Medková, Edita Pelantová, Laurent Vuillon
2019 C conf
On Palindromic Length of Sturmian Sequences.
DLT
Petr Ambroz, Edita Pelantová
2019 J jnl
On-line algorithms for multiplication and division in real and complex numeration systems.
Discret. Math. Theor. Comput. Sci.
Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová
2019 J jnl
Palindromic length of words and morphisms in class P.
Theor. Comput. Sci.
Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová
2018 J jnl
Fixed points of Sturmian morphisms and their derivated words.
Theor. Comput. Sci.
Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta
2017 J jnl
Exchange of three intervals: Substitutions and palindromicity.
Eur. J. Comb.
Zuzana Masáková, Edita Pelantová, Stepán Starosta
2017 — conf
On Words with the Zero Palindromic Defect.
WORDS
Edita Pelantová, Stepán Starosta
2017 J jnl
On the Zero Defect Conjecture.
Eur. J. Comb.
Sébastien Labbé, Edita Pelantová, Stepán Starosta
2016 J jnl
Constructions of words rich in palindromes and pseudopalindromes.
Discret. Math. Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2016 J jnl
On the Zero Defect Conjecture.
CoRR
Sébastien Labbé, Edita Pelantová, Stepán Starosta
2016 C conf
On-line Multiplication and Division in Real and Complex Bases.
ARITH
Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová
2016 J jnl
On-line algorithms for multiplication and division in real and complex numeration systems.
CoRR
Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová
2016 J jnl
Palindromic sequences generated from marked morphisms.
Eur. J. Comb.
Sébastien Labbé, Edita Pelantová
2016 J jnl
Spectral properties of cubic complex Pisot units.
Math. Comput.
Tomás Hejda, Edita Pelantová
2015 J jnl
Beta-representations of 0 and Pisot numbers.
CoRR
Christiane Frougny, Edita Pelantová
2015 C conf
Interval Exchange Words and the Question of Hof, Knill, and Simon.
DLT
Zuzana Masáková, Edita Pelantová, Stepán Starosta
2014 J jnl
Balances of m-bonacci Words.
Fundam. Informaticae
Karel Brinda, Edita Pelantová, Ondrej Turek
2014 J jnl
Palindromic closures using multiple antimorphisms.
Theor. Comput. Sci.
Tatiana Jajcayová, Edita Pelantová, Stepán Starosta
2014 J jnl
Palindromic richness for languages invariant under more symmetries.
Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2014 Misc conf
Parallel algorithms for addition in non-standard number systems.
ITA
Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová
2014 J jnl
k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems.
Theor. Comput. Sci.
Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová
2013 J jnl
Balances of
CoRR
Karel Brinda, Edita Pelantová, Ondrej Turek
2013 J jnl
Enumerating Abelian Returns to Prefixes of Sturmian Words
CoRR
Zuzana Masáková, Edita Pelantová
2013 — conf
Enumerating Abelian Returns to Prefixes of Sturmian Words.
WORDS
Zuzana Masáková, Edita Pelantová
2013 J jnl
Greedy and lazy representations in negative base systems.
Kybernetika
Tomás Hejda, Zuzana Masáková, Edita Pelantová
2013 J jnl
Languages invariant under more symmetries: Overlapping factors versus palindromic richness.
Discret. Math.
Edita Pelantová, Stepán Starosta
2013 J jnl
Proof of the Brlek-Reutenauer conjecture.
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2013 J jnl
Spectral Properties of Cubic Complex Pisot Units.
CoRR
Tomás Hejda, Edita Pelantová
2012 J jnl
Almost Rich Words as Morphic Images of Rich Words.
Int. J. Found. Comput. Sci.
Edita Pelantová, Stepán Starosta
2012 J jnl
Corrigendum: "On Brlek-Reutenauer conjecture".
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2012 J jnl
Proof of Brlek-Reutenauer conjecture
CoRR
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 J jnl
Arithmetics in number systems with a negative base.
Theor. Comput. Sci.
Zuzana Masáková, Edita Pelantová, Tomás Vávra
2011 J jnl
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers.
Integers
L'ubomíra Balková, Karel Klouda, Edita Pelantová
2011 C conf
Infinite Words Rich and Almost Rich in Generalized Palindromes.
Developments in Language Theory
Edita Pelantová, Stepán Starosta
2011 J jnl
Infinite words with finite defect.
Adv. Appl. Math.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 J jnl
Note on powers in three interval exchange transformations.
Theor. Comput. Sci.
Daniel Lenz, Zuzana Masáková, Edita Pelantová
2011 J jnl
Number representation using generalized $(-\beta)$-transformation
CoRR
Daniel Dombek, Zuzana Masáková, Edita Pelantová
2011 J jnl
Number representation using generalized (-beta)-transformation.
Theor. Comput. Sci.
Daniel Dombek, Zuzana Masáková, Edita Pelantová
2011 J jnl
On Brlek-Reutenauer conjecture.
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 J jnl
On the number of factors in codings of three interval exchange.
Discret. Math. Theor. Comput. Sci.
Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová
2011 J jnl
Parallel addition in non-standard numeration systems
CoRR
Christiane Frougny, Edita Pelantová, Milena Svobodová
2011 J jnl
Parallel addition in non-standard numeration systems.
Theor. Comput. Sci.
Christiane Frougny, Edita Pelantová, Milena Svobodová
2010 J jnl
Morphisms fixing words associated with exchange of three intervals.
RAIRO Theor. Informatics Appl.
Petr Ambroz, Zuzana Masáková, Edita Pelantová
2010 J jnl
Sturmian jungle (or garden?) on multiliteral alphabets.
RAIRO Theor. Informatics Appl.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2009 J jnl
A note on symmetries in the Rauzy graph and factor frequencies.
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová
2009 J jnl
Palindromes in infinite ternary words.
RAIRO Theor. Informatics Appl.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2009 J jnl
Relation between powers of factors and the recurrence function characterizing Sturmian words.
Theor. Comput. Sci.
Zuzana Masáková, Edita Pelantová
2008 J jnl
Matrices of 3-iet preserving morphisms.
Theor. Comput. Sci.
Petr Ambroz, Zuzana Masáková, Edita Pelantová
2007 J jnl
Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base.
Discret. Math. Theor. Comput. Sci.
Petr Ambroz, Zuzana Masáková, Edita Pelantová
2007 J jnl
Ambiguity in the m-Bonacci Numeration System.
Discret. Math. Theor. Comput. Sci.
Petra Kocábová, Zuzana Masáková, Edita Pelantová
2007 J jnl
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers.
RAIRO Theor. Informatics Appl.
L'ubomíra Balková, Edita Pelantová, Ondrej Turek
2007 J jnl
Factor versus palindromic complexity of uniformly recurrent infinite words.
Theor. Comput. Sci.
Peter Balázi, Zuzana Masáková, Edita Pelantová
2007 J jnl
Infinite Special Branches in Words Associated with Beta-Expansions.
Discret. Math. Theor. Comput. Sci.
Christiane Frougny, Zuzana Masáková, Edita Pelantová
2007 J jnl
On a class of infinite words with affine factor complexity.
Theor. Comput. Sci.
Julien Bernat, Zuzana Masáková, Edita Pelantová
2006 J jnl
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers
CoRR
L'ubomíra Balková, Edita Pelantová, Ondrej Turek
2006 J jnl
Sequences with constant number of return words
CoRR
L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner
2005 J jnl
Integers with a maximal number of Fibonacci representations.
RAIRO Theor. Informatics Appl.
Petra Kocábová, Zuzana Masáková, Edita Pelantová
2004 J jnl
Complexity of infinite words associated with beta-expansions.
RAIRO Theor. Informatics Appl.
Christiane Frougny, Zuzana Masáková, Edita Pelantová
2004 J jnl
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions.
RAIRO Theor. Informatics Appl.
Christiane Frougny, Zuzana Masáková, Edita Pelantová