Codes and automata in minimal sets

Dominique Perrin (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Théorie et langage formel [cs.FL]

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⟩