Edita Pelantová

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 37

Top Topics

Rewriting Rules

Repetitive Patterns

Top Venues

Theor. Comput. Sci.

Publications

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 (2024)
L'ubomíra Dvoráková, Edita Pelantová
The repetition threshold of episturmian sequences. Eur. J. Comb. 120 (2024)
Zuzana Masáková, Edita Pelantová, Katarína Studenicová
Rewriting Rules for Arithmetics in Alternate Base Systems. DLT (2023)
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
On balanced sequences and their critical exponent. Theor. Comput. Sci. 939 (2023)
Izabella Ingrid Farkas, Edita Pelantová, Milena Svobodová
From positional representation of numbers to positional representation of vectors. CoRR (2023)
L'ubomíra Dvoráková, Martin Masek, Edita Pelantová
On a Class of 2-Balanced Sequences. WORDS (2023)
Jana Lepsová, Edita Pelantová, Stepán Starosta
On a faithful representation of Sturmian morphisms. Eur. J. Comb. 110 (2023)
L'ubomíra Dvoráková, Daniela Opocenská, Edita Pelantová
Asymptotic repetitive threshold of balanced sequences. Math. Comput. 92 (341) (2022)
Francesco Dolce, Edita Pelantová
On Morphisms Preserving Palindromic Richness. Fundam. Informaticae 185 (1) (2022)
Jana Lepsová, Edita Pelantová, Stepán Starosta
On a faithful representation of Sturmian morphisms. CoRR (2022)
Émilie Charlier, Célia Cisternino, Zuzana Masáková, Edita Pelantová
Spectrum, algebraicity and normalization in alternate bases. CoRR (2022)
L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur
On minimal critical exponent of balanced sequences. Theor. Comput. Sci. 922 (2022)
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
Computation of Critical Exponent in Balanced Sequences. WORDS (2021)
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas, Laurent Vuillon
On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. 130 (2021)
Edita Pelantová, Stepán Starosta
On Sturmian substitutions closed under derivation. Theor. Comput. Sci. 867 (2021)
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
On balanced sequences and their critical exponent. CoRR (2021)
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
On Balanced Sequences and Their Asymptotic Critical Exponent. LATA (2021)
Katerina Medková, Edita Pelantová, Élise Vandomme
On non-repetitive complexity of Arnoux-Rauzy words. Discret. Appl. Math. 285 (2020)
Petr Ambroz, Zuzana Masáková, Edita Pelantová
Morphisms generating antipalindromic words. Eur. J. Comb. 89 (2020)
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)
Francesco Dolce, Edita Pelantová
On morphisms preserving palindromic richness. CoRR (2020)
Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová
On-line algorithms for multiplication and division in real and complex numeration systems. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Petr Ambroz, Edita Pelantová
On Palindromic Length of Sturmian Sequences. DLT (2019)
Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová
Palindromic length of words and morphisms in class P. Theor. Comput. Sci. 780 (2019)
Katerina Medková, Edita Pelantová, Laurent Vuillon
Derived sequences of complementary symmetric Rote sequences. RAIRO Theor. Informatics Appl. 53 (3-4) (2019)
Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta
Fixed points of Sturmian morphisms and their derivated words. Theor. Comput. Sci. 743 (2018)
Zuzana Masáková, Edita Pelantová, Stepán Starosta
Exchange of three intervals: Substitutions and palindromicity. Eur. J. Comb. 62 (2017)
Edita Pelantová, Stepán Starosta
On Words with the Zero Palindromic Defect. WORDS (2017)
Sébastien Labbé, Edita Pelantová, Stepán Starosta
On the Zero Defect Conjecture. Eur. J. Comb. 62 (2017)
Sébastien Labbé, Edita Pelantová, Stepán Starosta
On the Zero Defect Conjecture. CoRR (2016)
Edita Pelantová, Stepán Starosta
Constructions of words rich in palindromes and pseudopalindromes. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Tomás Hejda, Edita Pelantová
Spectral properties of cubic complex Pisot units. Math. Comput. 85 (297) (2016)
Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová
On-line Multiplication and Division in Real and Complex Bases. ARITH (2016)
Sébastien Labbé, Edita Pelantová
Palindromic sequences generated from marked morphisms. Eur. J. Comb. 51 (2016)
Marta Brzicova, Christiane Frougny, Edita Pelantová, Milena Svobodová
On-line algorithms for multiplication and division in real and complex numeration systems. CoRR (2016)
Zuzana Masáková, Edita Pelantová, Stepán Starosta
Interval Exchange Words and the Question of Hof, Knill, and Simon. DLT (2015)
Christiane Frougny, Edita Pelantová
Beta-representations of 0 and Pisot numbers. CoRR (2015)
Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová
Parallel algorithms for addition in non-standard number systems. ITA (2014)
Tatiana Jajcayová, Edita Pelantová, Stepán Starosta
Palindromic closures using multiple antimorphisms. Theor. Comput. Sci. 533 (2014)
Edita Pelantová, Stepán Starosta
Palindromic richness for languages invariant under more symmetries. Theor. Comput. Sci. 518 (2014)
Karel Brinda, Edita Pelantová, Ondrej Turek
Balances of m-bonacci Words. Fundam. Informaticae 132 (1) (2014)
Christiane Frougny, Pavel Heller, Edita Pelantová, Milena Svobodová
k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems. Theor. Comput. Sci. 543 (2014)
Zuzana Masáková, Edita Pelantová
Enumerating Abelian Returns to Prefixes of Sturmian Words CoRR (2013)
Tomás Hejda, Edita Pelantová
Spectral Properties of Cubic Complex Pisot Units. CoRR (2013)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475 (2013)
Zuzana Masáková, Edita Pelantová
Enumerating Abelian Returns to Prefixes of Sturmian Words. WORDS (2013)
Edita Pelantová, Stepán Starosta
Languages invariant under more symmetries: Overlapping factors versus palindromic richness. Discret. Math. 313 (21) (2013)
Tomás Hejda, Zuzana Masáková, Edita Pelantová
Greedy and lazy representations in negative base systems. Kybernetika 49 (2) (2013)
Karel Brinda, Edita Pelantová, Ondrej Turek
-bonacci words. CoRR (2013)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465 (2012)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of Brlek-Reutenauer conjecture CoRR (2012)
Edita Pelantová, Stepán Starosta
Almost Rich Words as Morphic Images of Rich Words. Int. J. Found. Comput. Sci. 23 (5) (2012)
Zuzana Masáková, Edita Pelantová, Tomás Vávra
Arithmetics in number systems with a negative base. Theor. Comput. Sci. 412 (8-10) (2011)
Edita Pelantová, Stepán Starosta
Infinite Words Rich and Almost Rich in Generalized Palindromes. Developments in Language Theory (2011)
Christiane Frougny, Edita Pelantová, Milena Svobodová
Parallel addition in non-standard numeration systems CoRR (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Infinite words with finite defect. Adv. Appl. Math. 47 (3) (2011)
Daniel Dombek, Zuzana Masáková, Edita Pelantová
Number representation using generalized (-beta)-transformation. Theor. Comput. Sci. 412 (48) (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412 (41) (2011)
Christiane Frougny, Edita Pelantová, Milena Svobodová
Parallel addition in non-standard numeration systems. Theor. Comput. Sci. 412 (41) (2011)
Daniel Lenz, Zuzana Masáková, Edita Pelantová
Note on powers in three interval exchange transformations. Theor. Comput. Sci. 412 (29) (2011)
Daniel Dombek, Zuzana Masáková, Edita Pelantová
Number representation using generalized $(-\beta)$-transformation CoRR (2011)
L'ubomíra Balková, Karel Klouda, Edita Pelantová
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers. Integers (2011)
Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová
On the number of factors in codings of three interval exchange. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44 (4) (2010)
Petr Ambroz, Zuzana Masáková, Edita Pelantová
Morphisms fixing words associated with exchange of three intervals. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Zuzana Masáková, Edita Pelantová
Relation between powers of factors and the recurrence function characterizing Sturmian words. Theor. Comput. Sci. 410 (38-40) (2009)
L'ubomíra Balková, Edita Pelantová
A note on symmetries in the Rauzy graph and factor frequencies. Theor. Comput. Sci. 410 (27-29) (2009)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43 (4) (2009)
Petr Ambroz, Zuzana Masáková, Edita Pelantová
Matrices of 3-iet preserving morphisms. Theor. Comput. Sci. 400 (1-3) (2008)
Petr Ambroz, Zuzana Masáková, Edita Pelantová
Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Christiane Frougny, Zuzana Masáková, Edita Pelantová
Infinite Special Branches in Words Associated with Beta-Expansions. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Petra Kocábová, Zuzana Masáková, Edita Pelantová
Ambiguity in the m-Bonacci Numeration System. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Julien Bernat, Zuzana Masáková, Edita Pelantová
On a class of infinite words with affine factor complexity. Theor. Comput. Sci. 389 (1-2) (2007)
Peter Balázi, Zuzana Masáková, Edita Pelantová
Factor versus palindromic complexity of uniformly recurrent infinite words. Theor. Comput. Sci. 380 (3) (2007)
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) (2007)
L'ubomíra Balková, Edita Pelantová, Wolfgang Steiner
Sequences with constant number of return words CoRR (2006)
L'ubomíra Balková, Edita Pelantová, Ondrej Turek
Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers CoRR (2006)
Petra Kocábová, Zuzana Masáková, Edita Pelantová
Integers with a maximal number of Fibonacci representations. RAIRO Theor. Informatics Appl. 39 (2) (2005)
Christiane Frougny, Zuzana Masáková, Edita Pelantová
Complexity of infinite words associated with beta-expansions. RAIRO Theor. Informatics Appl. 38 (2) (2004)
Christiane Frougny, Zuzana Masáková, Edita Pelantová
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. RAIRO Theor. Informatics Appl. 38 (3) (2004)