Perrin, D. Completing biprefix codes. (English) Zbl 0485.68075 Automata, languages and programming, 9th Colloq., Aarhus/Den. 1982, Lect. Notes Comput. Sci. 140, 397-406 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 7 Documents MSC: 68Q45 Formal languages and automata 20M35 Semigroups in automata theory, linguistics, etc. Keywords:maximal recognizable biprefix code; finite automata; formal series Citations:Zbl 0477.00027 × Cite Format Result Cite Review PDF