The meet operation in the lattice of codes

DOI10.1016/S0304-3975(96)00318-0zbMath1013.94009OpenAlexW2041044353MaRDI QIDQ1127316

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

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

Related Items (2)

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

Cites Work

• Synchronization and simplification
• Sur le théorème du defaut
• Each regular code is included in a maximal regular code
• Unnamed Item
• Unnamed Item
• Unnamed Item

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