On the syntactic transformation semigroup of a language generated by a finite biprefix code

Stuart W. Margolis

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Let P be a finite biprefix code and let X=(Q, S) be the syntactic transformation semigroup (ts) of P+. We show that if e ε{lunate} S is an idempotent, then the ts Xe = (Qe, eqe) consists of partial one to one maps. We also show that any ts of partial one to one maps divides a ts of partial one to one maps which is the syntactic ts of a finite biprefix code.

Original languageEnglish
Pages (from-to)225-230
Number of pages6
JournalTheoretical Computer Science
Volume21
Issue number2
DOIs
StatePublished - Nov 1982
Externally publishedYes

Fingerprint

Dive into the research topics of 'On the syntactic transformation semigroup of a language generated by a finite biprefix code'. Together they form a unique fingerprint.

Cite this