#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1999

2017

- This year (2)
- Last 5 years (21)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- L.-S. Guimond, Z. Masáková, E. Pelantová
- 2002

- Peter Balázi, Zuzana Masáková, Edita Pelantová
- Theor. Comput. Sci.
- 2007

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n) + P(n + 1) ≤ ∆C(n) + 2, for all n ∈ N. For a large class of words it is a better estimate of the palindromic complexity in terms of the factor complexity then the one presented in [2]. We provide several examples of… (More)

- Lubomíra Balková, Edita Pelantová, Stepán Starosta
- Theor. Comput. Sci.
- 2011

Keywords: Defect Rich word Full word Infinite word Factor complexity Palindromic complexity a b s t r a c t Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = ∑ +∞ n=0 T u (n) in which D(u) denotes the defect of u and T u (n) denotes C u (n + 1) − C u (n) + 2 − P u (n + 1) − P u (n),… (More)

- Petra Kocábová, Zuzana Masáková, Edita Pelantová
- Discrete Mathematics & Theoretical Computer…
- 2007

We study the properties of the function R (m) (n) defined as the number of representations of an integer n as a sum of distinct m-Bonacci numbers F

A simple Parry number is a real number β > 1 such that the Rényi expansion of 1 is finite, of the form d β (1) = t 1 · · · t m. We study the palindromic structure of infinite aperiodic words u β that are the fixed point of a substitution associated with a simple Parry number β. It is shown that the word u β contains infinitely many palindromes if and only… (More)

- Lubomíra Balková, Edita Pelantová, Wolfgang Steiner
- ArXiv
- 2006

An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R 2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m − 1)n + 1 and if it contains no weak bispecial factor. These conditions are necessary for m = 3, whereas for m = 4 the complexity function need not be 3n +… (More)

We provide a complete characterization of substitution invariant inhomogeneous bi-directional pointed Sturmian sequences. The result is analogous to that obtained by Berthé et al. [5] and Yasutomi [21] for one-directional Sturmian words. The proof is constructive , based on the geometric representation of Sturmian words by a cut-and-project scheme.

- Christiane Frougny, Zuzana Masáková, Edita Pelantová
- Discrete Mathematics & Theoretical Computer…
- 2007

A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous work we have determined the complexity of the fixed point u β of the canonical substitution associated with… (More)

a r t i c l e i n f o a b s t r a c t In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P ret closed under composition and we show that a uniformly recurrent word with finite defect is an image of a… (More)

- Zuzana Masáková, Edita Pelantová, Tomás Vávra
- Theor. Comput. Sci.
- 2011