Relation between powers of factors and the recurrence function characterizing Sturmian words

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Relation between powers of factors and the recurrence function characterizing Sturmian words

Original language description

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 index of a Sturmian word in terms of the continued fraction expansion of its slope.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

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

Name of the periodical

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Volume of the periodical

410

Issue of the periodical within the volume

38-40

Country of publishing house

GB - UNITED KINGDOM

Number of pages

8

Pages from-to

—

UT code for WoS article

000269683400002

EID of the result in the Scopus database

—