Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T20:53:32.992Z Has data issue: false hasContentIssue false

Bouquets of circles for lamination languages andcomplexities

Published online by Cambridge University Press:  10 July 2014

Philippe Narbel*
Affiliation:
LaBRI – UFR Math-Info, University of Bordeaux 1, 33405 Talence, France. . narbel@labri.fr

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Laminations are classic sets of disjoint and non-self-crossing curves on surfaces.Lamination languages are languages of two-way infinite words which code laminations byusing associated labeled embedded graphs, and which are subshifts. Here, we characterizethe possible exact affine factor complexities of these languages through bouquets ofcircles, i.e. graphs made of one vertex, as representative coding graphs.We also show how to build families of laminations together with corresponding laminationlanguages covering all the possible exact affine complexities.