Codes and automata in minimal sets

Abstract : We explore several notions concerning codes and automata in a restricted set of words S. We define a notion of S-degree of an automaton and prove an inequality relating the cardinality of a prefix code included in a minimal set S and its S-degree.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01855957
Contributor : Admin Upem <>
Submitted on : Wednesday, August 8, 2018 - 9:59:48 PM
Last modification on : Thursday, August 16, 2018 - 3:10:07 PM
Long-term archiving on : Friday, November 9, 2018 - 4:26:26 PM

File

wordsInvited.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Dominique Perrin. Codes and automata in minimal sets. WORDS 2015, Sep 2015, Kiel, Germany. pp.35-46, ⟨10.1007/978-3-319-23660-5_4⟩. ⟨hal-01855957⟩

Share

Metrics

Record views

85

Files downloads

76