Codes and Automata in Minimal Sets

DOI10.1007/978-3-319-23660-5_4zbMath1338.68157OpenAlexW2285037363MaRDI QIDQ3449355

Dominique Perrin

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01855957/file/wordsInvited.pdf

zbMATH Keywords

codeminimal setautomaton

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Presentations of Schützenberger groups of minimal subshifts.
• Codes and local constraints
• On the structure and extendibility of \(k\)-power free words
• Bifix codes and Sturmian words
• Acyclic, connected and tree sets
• Codes of central Sturmian words
• Maximal bifix decoding
• Green’s Relations and Their Use in Automata Theory
• Enumeration Formulæ in Neutral Sets
• Ensembles libres de chemins dans un graphe
• ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Codes and Automata in Minimal Sets