Some combinatorial properties of Sturmian words
type: Item
instance of: scholarly article
title: Some combinatorial properties of Sturmian words
zbMATH Open document ID: 0874.68245
DOI: 10.1016/0304-3975(94)00035-H
author: Filippo Mignosi
author: Aldo De Luca
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 983736
MaRDI profile type: Publication
cites work: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
cites work: A combinatorial property of the Fibonacci words
cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
cites work: Uniqueness Theorems for Periodic Functions
cites work: Sturmian Minimal Sets
cites work: Fast Pattern Matching in Strings
cites work: Q3659988
cites work: Infinite words with linear subword complexity
cites work: On the number of factors of Sturmian words
cites work: Q3754068
cites work: Q5603911
full work available at URL: 0304-3975(94)00035-h
OpenAlex ID: W2006661113
description: scientific article; zbMATH DE number 983736