Attributes | Values |
---|
rdf:type
| |
Description
| - We study infinite words u over an alphabet A satisfying the property (P): P(n) + P(n + 1) = 1 + #A for any non-negative integer n, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words satisfying a stronger property (PE) : every palindrome of u has exactly one palindromic extension in u. For binary words, the properties (P) and (PE) coincide and these properties characterize Sturmian words, i.e., words with the complexity C(n) = n+1 for any positive integer n. In this paper, we focus on ternary infinite words with the language closed under reversal. For such words u, we prove that if C(n) = 2n + 1 for any positive integer n then u satisfies the property (P) and moreover u is rich in palindromes. Also a sufficient condition for the property (PE) is given. We construct a word demonstrating that (P) on a ternary alphabet does not imply (PE).
- We study infinite words u over an alphabet A satisfying the property (P): P(n) + P(n + 1) = 1 + #A for any non-negative integer n, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words satisfying a stronger property (PE) : every palindrome of u has exactly one palindromic extension in u. For binary words, the properties (P) and (PE) coincide and these properties characterize Sturmian words, i.e., words with the complexity C(n) = n+1 for any positive integer n. In this paper, we focus on ternary infinite words with the language closed under reversal. For such words u, we prove that if C(n) = 2n + 1 for any positive integer n then u satisfies the property (P) and moreover u is rich in palindromes. Also a sufficient condition for the property (PE) is given. We construct a word demonstrating that (P) on a ternary alphabet does not imply (PE). (en)
|
Title
| - Palindromes in Infinite Ternary Words
- Palindromes in Infinite Ternary Words (en)
|
skos:prefLabel
| - Palindromes in Infinite Ternary Words
- Palindromes in Infinite Ternary Words (en)
|
skos:notation
| - RIV/68407700:21340/09:00164376!RIV10-MSM-21340___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA201/09/0584), P(LC06002), Z(MSM6840770039)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/68407700:21340/09:00164376
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - palindromes; factor complexity; infinite words (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - FR - Francouzská republika
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - RAIRO - Theoretical Informatics and Applications
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Balková, Lubomíra
- Pelantová, Edita
- Starosta, Štěpán
|
http://linked.open...ain/vavai/riv/wos
| |
http://linked.open...n/vavai/riv/zamer
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |