Sous-monoides et codes avec des mots infinis

DOI10.1007/BF02572821zbMATH Open0504.68054OpenAlexW2001565340MaRDI QIDQ1836313FDOQ1836313

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 codesvariable-length codesregular submonoid

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (4)

• Bi-infinitary codes
• On infinitary finite length codes
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• On a class of infinitary 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)