Filters
Palindromic length and reduction of powers
aperiodic infinite word x, the palindromic length of its factors is not bounded. Let x be an infinite aperiodic word with a bounded palindromic length and containing infinitely many occurrences of the fif...
Pure mathematics
- 2022 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Note on powers in three interval exchange transformations
We study repetitions in infinite words coding exchange of three intervals with permutation (3,2,1), called 3iet words. The language of such words is determined by two parameters $varepsilon,ell$. We show that finit...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Relation between powers of factors and the recurrence function characterizing Sturmian words
In this paper we use the relation of the index of an infinite aperiodic word and its recurrence function to give another characterization of Sturmian words. As a byproduct, we give a new proof of theorem describing the inde...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Critical Exponent of Infinite Words Coding Beta-integers Associated with Non-simple Parry Numbers
In this paper, we study the critical exponent of infinite words u coding beta- integers for beta being a non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in t...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter
Let L(k,α) denote the set of all bi-infinite α-power free words over an alphabet with k letters, where α is a positive rational number and k is a positive integer. We prove that if α>=5, k>=3, velementL(k,α), and w is a fin...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Repetitions in beta-integers
of combinatorics on words as a study of the index of infinite words coding ?-integers. Wewill...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Return Words and Recurrence Function of a Class of Infinite Words
Many combinatorial and arithmetical properties have been studied for infinite words associated with beta-integers. Here, new results describing return words and recurrence function for a special class of such words...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Infinite Words with Well Distributed Occurrences
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the well distributed occurrences (WELLDOC) ...
BA - Obecná matematika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
All About Infinite Words Associated with Quadratic Non-simple Parry Numbers
Study of factor complexity, palindromic complexity, and return words of infinite aperiodic words is an interesting combinatorial problem. Moreover, investigation of infinite words coding beta-integers, whi...
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 64 757