Completing comma-free codes
type: Item
instance of: scholarly article
title: Completing comma-free codes
zbMATH Open document ID: 1022.68059
DOI: 10.1016/S0304-3975(02)00595-9
author: Nguyen Huong Lam
published in: Theoretical Computer Science
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 1957352
zbMATH Keywords: comma-free codes
zbMATH Keywords: completion
zbMATH Keywords: regular maximal comma-free codes
MaRDI profile type: Publication
cites work: Q4430300
cites work: On completion of codes with finite deciphering delay
cites work: Each regular code is included in a maximal regular code
cites work: Codes with bounded synchronization delay
cites work: Comma-Free Codes
cites work: Q4198075
cites work: Automata accepting primitive words
cites work: Regent Results in Comma-Free Codes
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: Completing biprefix codes
cites work: Q4194483
cites work: Completion of recognizable bifix codes
description: scientific article; zbMATH DE number 1957352