The complexity of tangent words
Thierry Monteil (CNRS - Universit\'e Montpellier 2)
TL;DR
This paper investigates the complexity of languages formed by words representing smooth and analytic curves at small scales, building on prior work that characterized these words.
Contribution
It provides a computation of the complexity of languages associated with tangent words in smooth and analytic curves.
Findings
Calculated the complexity of tangent word languages.
Extended previous characterizations to quantitative complexity measures.
Enhanced understanding of the combinatorial structure of tangent words.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.