scientific article; zbMATH DE number 3763326

MaRDI QIDQ3945609zbMATH OpenFDO

Authors Dominique Perrin

Publication date 1982

zbMATH Keywords

finite automataformal seriesmaximal recognizable biprefix code

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Cited in

(7)

• Maximal codes with bounded deciphering delay
• Completion of codes with finite bi-decoding delays.
• Each regular code is included in a maximal regular code
• On the maximality of languages with combined types of code properties
• On group codes
• Completion of recognizable bifix codes
• On completion of codes with finite deciphering delay

This page was built for publication:

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