The complexity of tangent words
Discrete Mathematics
2011-08-19 v1 Computational Geometry
Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.1108.3632,
title = {The complexity of tangent words},
author = {Thierry Monteil},
journal= {arXiv preprint arXiv:1108.3632},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412