2013
DOI: 10.1007/978-3-642-39274-0_2
|View full text |Cite
|
Sign up to set email alerts
|

Automata for Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…In particular, prefix and suffix codes are prefix-free and suffix-free languages, respectively, while bifix-free languages can serve as both kinds of codes. For a survey about codes see [1,19]. Moreover, they are special cases of convex languages (see e.g.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, prefix and suffix codes are prefix-free and suffix-free languages, respectively, while bifix-free languages can serve as both kinds of codes. For a survey about codes see [1,19]. Moreover, they are special cases of convex languages (see e.g.…”
Section: Introductionmentioning
confidence: 99%