Palindromes in Infinite Words

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F09%3A00165554" target="_blank" >RIV/68407700:21340/09:00165554 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Palindromes in Infinite Words

Original language description

We study infinite words $mathbf{u}$ which generalize Sturmian words for a multiliteral alphabet $A$. The generalization is defined by property [mathcal{PE}: quad hbox{every palindrome of $mathbf{u}$ has exactly one palindromic extension in $mathbf{u}$},.] We focus on infinite words with the language closed under reversal and complexity $(# A - 1)n + 1$. A sufficient and necessary condition of property $mathcal{PE} is shown.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Doktorandské dny 2009

ISBN

978-80-01-04436-0

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

—

Publisher name

Česká technika - nakladatelství ČVUT

Place of publication

Praha

Event location

Praha

Event date

Nov 13, 2009

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—