Variable length codes and finite automata

MaRDI QIDQ3062121zbMATH OpenFDO

Authors Marie-Pierre Béal, Jean Berstel, Brian Marcus, Dominique Perrin, Christophe Reutenauer, Paul Siegel

Publication date 3 January 2011

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Linear codes (general theory) (94B05)

Recommendations

• Codes and automata.
• Variable-length error-correcting codes based on finite automata
• scientific article; zbMATH DE number 3943051
• scientific article; zbMATH DE number 5170141
• scientific article; zbMATH DE number 3928880

Cited in

(9)

• Variable-length codes independent or closed with respect to edit relations
• Graded alphabets, circular codes, free Lie algebras and comma-free codes
• A note on the factorization conjecture
• On the size of transducers for bidirectional decoding of prefix codes
• Codes and automata.
• Automates et codes zigzag
• Automata for codes
• Complete variable-length codes: an excursion into word edit operations
• Transducers for the bidirectional decoding of prefix codes

This page was built for publication: Variable length codes and finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062121)