L'ubomíra Dvoráková

Theor. Comput. Sci., February, 2024

2023

On balanced sequences and their critical exponent.

[BibT_eX]

[DOI]

Francesco Dolce

Theor. Comput. Sci., 2023

Critical exponent of binary words with few distinct palindromes.

[BibT_eX]

[DOI]

Pascal Ochem

Daniela Opocenská

CoRR, 2023

On a Class of 2-Balanced Sequences.

[BibT_eX]

[DOI]

Martin Masek

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

Critical Exponents of Regular Arnoux-Rauzy Sequences.

[BibT_eX]

[DOI]

Jana Lepsová

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

2021

On Balanced Sequences and Their Asymptotic Critical Exponent.

[BibT_eX]

[DOI]

Francesco Dolce

Proceedings of the Language and Automata Theory and Applications, 2021

Computation of Critical Exponent in Balanced Sequences.

[BibT_eX]

[DOI]

Francesco Dolce

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

2020

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

[BibT_eX]

[DOI]

Katerina Medková

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

2019

Normalization of ternary generalized pseudostandard words.

[BibT_eX]

[DOI]

Josef Florian

Tereza Veselá

Theor. Comput. Sci., 2019

2018

Fixed Points of Morphisms Among Binary Generalized Pseudostandard Words.

[BibT_eX]

[DOI]

Tereza Velká

Integers, 2018

2017

A New Estimate on Complexity of Binary Generalized Pseudostandard Words.

[BibT_eX]

[DOI]

Josef Florian

Integers, 2017

2016

Aperiodic pseudorandom number generators based on infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On Periodicity of Generalized Pseudostandard Words.

[BibT_eX]

[DOI]

Josef Florian

Electron. J. Comb., 2016

2013

Proof of the Brlek-Reutenauer conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Infinite Words with Well Distributed Occurrences.

[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

Factor frequencies in generalized Thue-Morse words.

[BibT_eX]

[DOI]

Kybernetika, 2012

Factor Frequencies in Languages Invariant Under Symmetries Preserving Factor Frequencies.

[BibT_eX]

[DOI]

Integers, 2012

2011

On Brlek-Reutenauer conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Abelian complexity of infinite words associated with quadratic Parry numbers.

[BibT_eX]

[DOI]

Karel Brinda

Ondrej Turek

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

Infinite words with finite defect.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

2010

Sturmian jungle (or garden?) on multiliteral alphabets.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

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

Palindromic complexity of infinite words associated with non-simple Parry numbers.

[BibT_eX]

[DOI]

Zuzana Masáková

RAIRO Theor. Informatics Appl., 2009

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

2006

Sequences with constant number of return words

[BibT_eX]

[DOI]