Sous-monoides et codes avec des mots infinis

DOI10.1007/BF02572821MaRDI QIDQ1836313zbMATH OpenOpenAlexFDO

Authors Do Long Van

Publication date 1983

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/134593

zbMATH Keywords

codefree monoidprefix codesregular submonoidvariable-length codes

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70) Artificial intelligence (68T99) Prefix, length-variable, comma-free codes (94A45)

Cited in

(4)

• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• Bi-infinitary codes
• On a class of infinitary codes
• On infinitary finite length codes

This page was built for publication: Sous-monoides et codes avec des mots infinis

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