About: Palindromes in Infinite Ternary Words

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Palindromes in Infinite Ternary Words Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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	P Z
http://linked.open...avai/riv/aktivity	P(GA201/09/0584), P(LC06002), Z(MSM6840770039)
http://linked.open...iv/cisloPeriodika	4
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Pelantová, Edita Balková, Lubomíra Starosta, Štěpán
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta jaderná a fyzikálně inženýrská
http://linked.open...dnocenehoVysledku	332553
http://linked.open...ai/riv/idVysledku	RIV/68407700:21340/09:00164376
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	palindromes; factor complexity; infinite words (en)
http://linked.open.../riv/klicoveSlovo	palindromes factor complexity infinite words
http://linked.open...odStatuVydavatele	FR - Francouzská republika
http://linked.open...ontrolniKodProRIV	[47B237F81365]
http://linked.open...i/riv/nazevZdroje	RAIRO - Theoretical Informatics and Applications
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Algebraic and combinatorial aspects of aperiodic structures Doppler Institute for Mathematical Physics and Applied Mathematics
http://linked.open...UplatneniVysledku	2009
http://linked.open...v/svazekPeriodika	43
http://linked.open...iv/tvurceVysledku	Balková, Lubomíra Pelantová, Edita Starosta, Štěpán
http://linked.open...ain/vavai/riv/wos	000271470900002
http://linked.open...n/vavai/riv/zamer	Matematické, počítačové a experimentální metody ve fyzice
issn	0988-3754
number of pages	16 (xsd:int)
http://localhost/t...ganizacniJednotka	21340
is http://linked.open...avai/riv/vysledek of	Palindromes in Infinite Ternary Words Palindromes in Infinite Ternary Words Palindromes in Infinite Ternary Words Palindromes in Infinite Ternary Words

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software