2015
DOI: 10.1007/978-3-319-23660-5_4
|View full text |Cite
|
Sign up to set email alerts
|

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 13 publications
(22 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?