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.
Cite
CITATION STYLE
APA
Perrin, D. (2015). Codes and automata in minimal sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9304, pp. 35–46). Springer Verlag. https://doi.org/10.1007/978-3-319-23660-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free