2015 | OriginalPaper | Chapter
Coding Non-orientable Laminations
Authors : Luis-Miguel Lopez, Philippe Narbel
Published in: Language and Automata Theory and Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Surface laminations are classic closed sets of disjoint curves in surfaces. We give here a full description of how to obtain codings of such laminations when they are non-orientable by using lamination languages, i.e. specific linear complexity languages of two-way infinite words. We also compare lamination languages with symbolic laminations, i.e. the coding counterparts of algebraic laminations.