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

Stuart W. Margolis

doi:10.1016/0304-3975(89)90085-6

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

Stuart W. Margolis

University of Vermont

Research output: Contribution to journal › Article › peer-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 X_e = (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 language	English
Pages (from-to)	225-230
Number of pages	6
Journal	Theoretical Computer Science
Volume	21
Issue number	2
DOIs	https://doi.org/10.1016/0304-3975(89)90085-6
State	Published - Nov 1982
Externally published	Yes

Access to Document

10.1016/0304-3975(89)90085-6

Cite this

@article{40fd09e341b742779b1ed3f8a947c9ef,

title = "On the syntactic transformation semigroup of a language generated by a finite biprefix code",

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.",

author = "Margolis, \{Stuart W.\}",

year = "1982",

month = nov,

doi = "10.1016/0304-3975(89)90085-6",

language = "אנגלית",

volume = "21",

pages = "225--230",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Margolis, Stuart W.

PY - 1982/11

Y1 - 1982/11

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/27644562886

U2 - 10.1016/0304-3975(89)90085-6

DO - 10.1016/0304-3975(89)90085-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:27644562886

SN - 0304-3975

VL - 21

SP - 225

EP - 230

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this