Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2006
Springer

favoriteEmaildiscussreport

131views Education» more CORR 2006»

Sequences with constant number of return words

13 years 4 months ago

Sequences with constant number of return words

Download www.liafa.jussieu.fr

An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m-1)n+1 and if it contains no weak bispecial factor. These conditions

Lubomíra Balková, Edita Pelantov&aac

Real-time Traffic

Characterizes Sturmian Words | CORR 2006 | Education | Infinite Word | Property Rm |

claim paper

Related Content

» Relationally Periodic Sequences and Subword Complexity

» Optimal static range reporting in one dimension

» VARUN Discovering Extensible Motifs under Saturation Constraints

» Learning of EventRecording Automata

» Parameterized pattern queries

» Storage and Retrieval of Individual Genomes

» A note concerning the closest point pair algorithm

» Precise Interprocedural Dependence Analysis of Parallel Programs

» Incremental Unsupervised Time Series Analysis Using Merge Growing Neural Gas

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Lubomíra Balková, Edita Pelantová, Wolfgang Steiner

Comments (0)