Codes and automata in minimal sets

DOI10.1007/978-3-319-23660-5_4zbMATH Open1338.68157OpenAlexW2285037363MaRDI QIDQ3449355FDOQ3449355

Authors: 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

Recommendations

• Codes circulaires, automates locaux et entropie
• scientific article
• Codes, unambiguous automata and sofic systems.
• On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality
• scientific article

zbMATH Keywords

automatoncodeminimal set

Mathematics Subject Classification ID

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

Cites Work

• Episturmian words and some constructions of de Luca and Rauzy
• Green's relations and their use in automata theory
• Presentations of Schützenberger groups of minimal subshifts.
• Codes and local constraints
• Bifix codes and Sturmian words
• Codes of central Sturmian words
• Maximal bifix decoding
• Acyclic, connected and tree sets
• On the transition semigroups of centrally labeled Rauzy graphs.
• On the structure and extendibility of \(k\)-power free words
• Enumeration Formulæ in Neutral Sets
• Ensembles libres de chemins dans un graphe

Cited In (4)

• Automata for solid codes
• A coding theorem for enumerable output machines
• Automates et codes zigzag
• Codes circulaires, automates locaux et entropie

This page was built for publication: Codes and automata in minimal sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449355)