Filtry
On Palindromic Length of Sturmian Sequences
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word ......
Pure mathematics
- 2019 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On highly palindromic words
The paper studies some properties of palindromic (scattered) subwords of binary words. We construct a family of words with the highest possible degree of palindromicity....
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On Words with the Zero Palindromic Defect
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors ...
Pure mathematics
- 2017 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Hardware Acceleration of Approximate Palindromes Searching
We present FPGA-based hardware architecture for approximate palindrome searching...
JC - Počítačový hardware a software
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Palindromic length of words and morphisms in class P
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class P introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word ...
Pure mathematics
- 2019 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Factor and Palindromic Complexity of The-Morse's Avatars
Two infinite words that are connected with some significant univoque numbers are studied. It is shown that their factor and palindromic complexities almost coincide with the factor and palindromic complexities of the famous Thue-Mor...
BA - Obecná matematika
- 2013 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Palindromic richness for languages invariant under more symmetries
in generalized palindromic factors, i.e., in factors $w$ satisfying $Theta(w) = w$ for some palindromes) and show two examples of $G$-rich words....
BA - Obecná matematika
- 2014 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Identification of palindrome-forming sequences
This software is focused on detection of specific secondary structures forming palindromes in DNA. The program is based on dynamic programming technique. In comparison to other approaches it is able to detect palindromes with defec...
JC - Počítačový hardware a software
- 2010 •
- R
Rok uplatnění
R - Software
Morphic images of episturmian words having finite palindromic defect
an infinite word having zero palindromic defect to a word having infinite palindromic defect. We show that the image of an episturmian word, which has zero palindromic defect, under a morphism of class $P_{ret}$ has always...
BA - Obecná matematika
- 2016 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Palindromic Length of Words with Many Periodic Palindromes
The palindromic length PL(v) of a finite word v is the minimal number of palindromes whose concatenation is equal to v. In 2013, Frid, Puzynina, and Zamboni) be the set of all factors u of w that have more than sqrt[k](k^{-1}|u|) <...
Pure mathematics
- 2020 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 z 137