scientific article; zbMATH DE number 3988734

zbMATH Open0611.68046MaRDI QIDQ3751031FDOQ3751031

Authors: Do Long Van 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Algorithmic ways of deciding whether an infinite language is a code
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• scientific article; zbMATH DE number 33205
• Bi-infinitary codes
• scientific article; zbMATH DE number 176151

zbMATH Keywords

infinitary languagesinfinitary codequasi-free monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (3)

• Title not available (Why is that?)
• Bi-infinitary codes
• Title not available (Why is that?)

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 Q3751031)