On the syntactic transformation semigroup of a language generated by a finite biprefix code
type: Item
instance of: scholarly article
title: On the syntactic transformation semigroup of a language generated by a finite biprefix code
zbMATH Open document ID: 0486.68078
DOI: 10.1016/0304-3975(89)90085-6
author: S. W. Margolis
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 3765178
zbMATH Keywords: biprefix code
zbMATH Keywords: syntactic transformation semigroup
zbMATH Keywords: idempotent
zbMATH Keywords: partial one to one maps
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90085-6
OpenAlex ID: W2074836723
cites work: On certain codes admitting inverse semigroups as syntactic monoids
cites work: Q3853827
cites work: On varieties of rational languages and variable length codes. II
cites work: Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
cites work: On varieties of rational languages and variable-length codes
cites work: Une topologie du monoide libre
cites work: Sur mon article ''Une topologie du monoide libre''
cites work: Sur le produit de concatenation non ambigu
cites work: On the complexity of finite semigroups
description: scientific article; zbMATH DE number 3765178