Finite maximal infix codes
type: Item
instance of: scholarly article
title: Finite maximal infix codes
zbMATH Open document ID: 0981.68106
author: Nguyen Huong Lam
published in: Semigroup Forum
publication date: 2000-12-19T00:00:00Z
review text: A set \(X\) of words over an alphabet \(A\) is an infix code, if no word in \(X\) is a factor of any other word in \(X\). The author first shows that any finite infix code can be completed to a finite maximal infix code. In the main results of the paper he proves that every maximal infix code can be produced from the underlying alphabet \(A\) by finitely many successive applications of two kinds of set-transformations.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 1545247
zbMATH Keywords: infix code
reviewed by: Yuji Kobayashi
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1545247