Edita Pelantová

Orcid: 0000-0003-3817-2943

Affiliations:
  • Czech Technical University


According to our database1, Edita Pelantová authored at least 67 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On a faithful representation of Sturmian morphisms.
Eur. J. Comb., May, 2023

On balanced sequences and their critical exponent.
Theor. Comput. Sci., 2023

From positional representation of numbers to positional representation of vectors.
CoRR, 2023

Rewriting Rules for Arithmetics in Alternate Base Systems.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

On a Class of 2-Balanced Sequences.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
Asymptotic repetitive threshold of balanced sequences.
Math. Comput., November, 2022

On minimal critical exponent of balanced sequences.
Theor. Comput. Sci., 2022

On Morphisms Preserving Palindromic Richness.
Fundam. Informaticae, 2022

Spectrum, algebraicity and normalization in alternate bases.
CoRR, 2022

2021
On Sturmian substitutions closed under derivation.
Theor. Comput. Sci., 2021

On the Markov numbers: Fixed numerator, denominator, and sum conjectures.
Adv. Appl. Math., 2021

On Balanced Sequences and Their Asymptotic Critical Exponent.
Proceedings of the Language and Automata Theory and Applications, 2021

Computation of Critical Exponent in Balanced Sequences.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020
Morphisms generating antipalindromic words.
Eur. J. Comb., 2020

Complementary symmetric Rote sequences: the critical exponent and the recurrence function.
Discret. Math. Theor. Comput. Sci., 2020

On non-repetitive complexity of Arnoux-Rauzy words.
Discret. Appl. Math., 2020

2019
Palindromic length of words and morphisms in class P.
Theor. Comput. Sci., 2019

Derived sequences of complementary symmetric Rote sequences.
RAIRO Theor. Informatics Appl., 2019

On-line algorithms for multiplication and division in real and complex numeration systems.
Discret. Math. Theor. Comput. Sci., 2019

On Palindromic Length of Sturmian Sequences.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
Fixed points of Sturmian morphisms and their derivated words.
Theor. Comput. Sci., 2018

2017
Exchange of three intervals: Substitutions and palindromicity.
Eur. J. Comb., 2017

On the Zero Defect Conjecture.
Eur. J. Comb., 2017

On Words with the Zero Palindromic Defect.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Spectral properties of cubic complex Pisot units.
Math. Comput., 2016

Palindromic sequences generated from marked morphisms.
Eur. J. Comb., 2016

Constructions of words rich in palindromes and pseudopalindromes.
Discret. Math. Theor. Comput. Sci., 2016

On-line Multiplication and Division in Real and Complex Bases.
Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015
Beta-representations of 0 and Pisot numbers.
CoRR, 2015

Interval Exchange Words and the Question of Hof, Knill, and Simon.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Palindromic richness for languages invariant under more symmetries.
Theor. Comput. Sci., 2014

Palindromic closures using multiple antimorphisms.
Theor. Comput. Sci., 2014

k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems.
Theor. Comput. Sci., 2014

Balances of m-bonacci Words.
Fundam. Informaticae, 2014

Parallel algorithms for addition in non-standard number systems.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2013
Proof of the Brlek-Reutenauer conjecture.
Theor. Comput. Sci., 2013

Greedy and lazy representations in negative base systems.
Kybernetika, 2013

Languages invariant under more symmetries: Overlapping factors versus palindromic richness.
Discret. Math., 2013

Balances of <i>m</i>-bonacci words.
CoRR, 2013

Enumerating Abelian Returns to Prefixes of Sturmian Words.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Corrigendum: "On Brlek-Reutenauer conjecture".
Theor. Comput. Sci., 2012

Almost Rich Words as Morphic Images of Rich Words.
Int. J. Found. Comput. Sci., 2012

2011
Arithmetics in number systems with a negative base.
Theor. Comput. Sci., 2011

Note on powers in three interval exchange transformations.
Theor. Comput. Sci., 2011

Parallel addition in non-standard numeration systems.
Theor. Comput. Sci., 2011

Number representation using generalized (-beta)-transformation.
Theor. Comput. Sci., 2011

On Brlek-Reutenauer conjecture.
Theor. Comput. Sci., 2011

Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers.
Integers, 2011

On the number of factors in codings of three interval exchange.
Discret. Math. Theor. Comput. Sci., 2011

Infinite words with finite defect.
Adv. Appl. Math., 2011

Infinite Words Rich and Almost Rich in Generalized Palindromes.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Sturmian jungle (or garden?) on multiliteral alphabets.
RAIRO Theor. Informatics Appl., 2010

Morphisms fixing words associated with exchange of three intervals.
RAIRO Theor. Informatics Appl., 2010

2009
Relation between powers of factors and the recurrence function characterizing Sturmian words.
Theor. Comput. Sci., 2009

A note on symmetries in the Rauzy graph and factor frequencies.
Theor. Comput. Sci., 2009

Palindromes in infinite ternary words.
RAIRO Theor. Informatics Appl., 2009

2008
Matrices of 3-iet preserving morphisms.
Theor. Comput. Sci., 2008

2007
On a class of infinite words with affine factor complexity.
Theor. Comput. Sci., 2007

Factor versus palindromic complexity of uniformly recurrent infinite words.
Theor. Comput. Sci., 2007

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers.
RAIRO Theor. Informatics Appl., 2007

Ambiguity in the m-Bonacci Numeration System.
Discret. Math. Theor. Comput. Sci., 2007

Infinite Special Branches in Words Associated with Beta-Expansions.
Discret. Math. Theor. Comput. Sci., 2007

Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base.
Discret. Math. Theor. Comput. Sci., 2007

2006
Sequences with constant number of return words
CoRR, 2006

2005
Integers with a maximal number of Fibonacci representations.
RAIRO Theor. Informatics Appl., 2005

2004
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions.
RAIRO Theor. Informatics Appl., 2004

Complexity of infinite words associated with beta-expansions.
RAIRO Theor. Informatics Appl., 2004


  Loading...