The meet operation in the lattice of codes

DOI10.1016/S0304-3975(96)00318-0MaRDI QIDQ1127316zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère, Denis Derencourt, Michel Latteux

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(96)00318-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• On the lattice of prefix codes.
• scientific article; zbMATH DE number 3926268
• Publication:3476744
• Monoids and maximal codes
• scientific article; zbMATH DE number 4087599

Cites work

• scientific article; zbMATH DE number 3861454 (Why is no real title available?)
• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• Each regular code is included in a maximal regular code
• Sur le théorème du defaut
• Synchronization and simplification

Cited in

(2)

• On the lattice of prefix codes.
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid

This page was built for publication: The meet operation in the lattice of codes

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