Completing biprefix codes
type: Item
instance of: scholarly article
title: Completing biprefix codes
zbMATH Open document ID: 0534.68052
DOI: 10.1016/0304-3975(83)90028-2
author: Dominique Perrin
published in: Theoretical Computer Science
publication date: 1984-01-01T00:00:00Z
review text: This short and well-written paper shows that each finite biprefix code can be extended to a recognizable maximal biprefix code. To obtain this result the author proves some other interesting facts for biprefix codes in terms of formal power series.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 3848631
zbMATH Keywords: biprefix codes
zbMATH Keywords: formal power series
reviewed by: Tero Harju
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90028-2
OpenAlex ID: W2083135460
cites work: Q4430300
cites work: Each regular code is included in a maximal regular code
cites work: Q4079524
cites work: Codes asynchrones
cites work: Q4171972
cites work: Q4155837
cites work: A remark on incompletely specified automata
cites work: On a Special Class of Recurrent Events
description: scientific article; zbMATH DE number 3848631