Sous-monoides et codes avec des mots infinis

DOI10.1007/BF02572821zbMath0504.68054OpenAlexW2001565340MaRDI QIDQ1836313

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

codeprefix codesvariable-length codesfree monoidregular submonoid

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item

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