Edita Pelantová

Theory Comput. Syst., December, 2024

An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

The repetition threshold of episturmian sequences.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

2023

On a faithful representation of Sturmian morphisms.

[BibT_eX]

[DOI]

Jana Lepsová

Eur. J. Comb., May, 2023

On balanced sequences and their critical exponent.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

From positional representation of numbers to positional representation of vectors.

[BibT_eX]

[DOI]

Izabella Ingrid Farkas

Milena Svobodová

CoRR, 2023

Rewriting Rules for Arithmetics in Alternate Base Systems.

[BibT_eX]

[DOI]

Katarína Studenicová

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

On a Class of 2-Balanced Sequences.

[BibT_eX]

[DOI]

Martin Masek

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Asymptotic repetitive threshold of balanced sequences.

[BibT_eX]

[DOI]

Daniela Opocenská

Math. Comput., November, 2022

On minimal critical exponent of balanced sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On Morphisms Preserving Palindromic Richness.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

Spectrum, algebraicity and normalization in alternate bases.

[BibT_eX]

[DOI]

CoRR, 2022

2021

On Sturmian substitutions closed under derivation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the Markov numbers: Fixed numerator, denominator, and sum conjectures.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

On Balanced Sequences and Their Asymptotic Critical Exponent.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

Computation of Critical Exponent in Balanced Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020

Morphisms generating antipalindromic words.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Complementary symmetric Rote sequences: the critical exponent and the recurrence function.

[BibT_eX]

[DOI]

Katerina Medková

Discret. Math. Theor. Comput. Sci., 2020

On non-repetitive complexity of Arnoux-Rauzy words.

[BibT_eX]

[DOI]

Katerina Medková

Élise Vandomme

Discret. Appl. Math., 2020

2019

Palindromic length of words and morphisms in class P.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Derived sequences of complementary symmetric Rote sequences.

[BibT_eX]

[DOI]

Katerina Medková

Laurent Vuillon

RAIRO Theor. Informatics Appl., 2019

On-line algorithms for multiplication and division in real and complex numeration systems.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

On Palindromic Length of Sturmian Sequences.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Fixed points of Sturmian morphisms and their derivated words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2017

Exchange of three intervals: Substitutions and palindromicity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

On the Zero Defect Conjecture.

[BibT_eX]

[DOI]

Sébastien Labbé

Eur. J. Comb., 2017

On Words with the Zero Palindromic Defect.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Spectral properties of cubic complex Pisot units.

[BibT_eX]

[DOI]

Tomás Hejda

Math. Comput., 2016

Palindromic sequences generated from marked morphisms.

[BibT_eX]

[DOI]

Sébastien Labbé

Eur. J. Comb., 2016

Constructions of words rich in palindromes and pseudopalindromes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

On-line Multiplication and Division in Real and Complex Bases.

[BibT_eX]

[DOI]

Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015

Beta-representations of 0 and Pisot numbers.

[BibT_eX]

[DOI]

CoRR, 2015

Interval Exchange Words and the Question of Hof, Knill, and Simon.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Palindromic richness for languages invariant under more symmetries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Palindromic closures using multiple antimorphisms.

[BibT_eX]

[DOI]

Tatiana Jajcayová

Theor. Comput. Sci., 2014

k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Balances of m-bonacci Words.

[BibT_eX]

[DOI]

Karel Brinda

Ondrej Turek

Fundam. Informaticae, 2014

Parallel algorithms for addition in non-standard number systems.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2013

Proof of the Brlek-Reutenauer conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Greedy and lazy representations in negative base systems.

[BibT_eX]

[DOI]

Tomás Hejda

Kybernetika, 2013

Languages invariant under more symmetries: Overlapping factors versus palindromic richness.

[BibT_eX]

[DOI]

Discret. Math., 2013

Balances of <i>m</i>-bonacci words.

[BibT_eX]

[DOI]

Karel Brinda

Ondrej Turek

CoRR, 2013

Enumerating Abelian Returns to Prefixes of Sturmian Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Corrigendum: "On Brlek-Reutenauer conjecture".

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Almost Rich Words as Morphic Images of Rich Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

2011

Arithmetics in number systems with a negative base.

[BibT_eX]

[DOI]

Tomás Vávra

Theor. Comput. Sci., 2011

Note on powers in three interval exchange transformations.

[BibT_eX]

[DOI]

Daniel Lenz

Theor. Comput. Sci., 2011

Parallel addition in non-standard numeration systems.

[BibT_eX]

[DOI]

Milena Svobodová

Theor. Comput. Sci., 2011

Number representation using generalized (-beta)-transformation.

[BibT_eX]

[DOI]

Daniel Dombek

Theor. Comput. Sci., 2011

On Brlek-Reutenauer conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Karel Klouda

Integers, 2011

On the number of factors in codings of three interval exchange.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2011

Infinite words with finite defect.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

Infinite Words Rich and Almost Rich in Generalized Palindromes.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Sturmian jungle (or garden?) on multiliteral alphabets.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

Morphisms fixing words associated with exchange of three intervals.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

2009

Relation between powers of factors and the recurrence function characterizing Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A note on symmetries in the Rauzy graph and factor frequencies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Palindromes in infinite ternary words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

2008

Matrices of 3-iet preserving morphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

On a class of infinite words with affine factor complexity.

[BibT_eX]

[DOI]

Julien Bernat

Theor. Comput. Sci., 2007

Factor versus palindromic complexity of uniformly recurrent infinite words.

[BibT_eX]

[DOI]

Peter Balázi

Theor. Comput. Sci., 2007

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers.

[BibT_eX]

[DOI]

Ondrej Turek

RAIRO Theor. Informatics Appl., 2007

Ambiguity in the m-Bonacci Numeration System.

[BibT_eX]

[DOI]

Petra Kocábová

Discret. Math. Theor. Comput. Sci., 2007

Infinite Special Branches in Words Associated with Beta-Expansions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

2006

Sequences with constant number of return words

[BibT_eX]

[DOI]

Wolfgang Steiner

CoRR, 2006

2005

Integers with a maximal number of Fibonacci representations.

[BibT_eX]

[DOI]

Petra Kocábová

RAIRO Theor. Informatics Appl., 2005

2004

Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

Complexity of infinite words associated with beta-expansions.

[BibT_eX]

[DOI]