The complexity of tangent words

Thierry Monteil

Retour

Acte de colloque

The complexity of tangent words

Thierry Monteil

Electronic Proceedings in Theoretical Computer Science, pp.152-157

Electronic Proceedings in Theoretical Computer Science

Words 2011 (Prague, Czech Republic, 12/09/2011–16/09/2011)

09/2011

Résumé

Cutting sequence

symbolic coding

word complexity

multigrid convergence

Sturmian word

In a previous paper, we described the set of words that appear in the coding of smooth (resp. analytic) curves at arbitrary small scale. The aim of this paper is to compute the complexity of those languages.

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: The complexity of tangent words
Créateurs - sans rôle: Thierry Monteil - Arithmétique informatique
Détails de publication: Electronic Proceedings in Theoretical Computer Science, pp.152-157
Colloque: Words 2011 (Prague, Czech Republic, 12/09/2011–16/09/2011)
Publications en série: Electronic Proceedings in Theoretical Computer Science
Identifiants: 99151372009311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-00799745