The complexity of tangent words

DOI10.4204/EPTCS.63.21MaRDI QIDQ2789525zbMATH OpenWikidataFDO

Authors Thierry Monteil

Publication date 1 March 2016

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.3632, http://www.emis.de/proceedings/Words2011/paper-18.html?WORDS2011.21

zbMATH Keywords

cutting sequencemultigrid convergenceSturmian wordsymbolic codingword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: 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.

Recommendations

• Another definition for digital tangents
• Linear complexity words and surface laminations
• scientific article; zbMATH DE number 1091206
• Three complexity functions
• Symbolic analysis of finite words: the complexity function

Cited in

(3)

• Lie complexity of words
• Another definition for digital tangents
• Complexity of cutting words on regular tilings

This page was built for publication: The complexity of tangent words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789525)