Paper Info
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 ϵ 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.
Year
DOI
Venue
1982
10.1016/0304-3975(89)90085-6
THEORETICAL COMPUTER SCIENCE
DocType
Volume
Issue
Journal
21
2
ISSN
Citations 
PageRank 
0304-3975
5
2.17
References 
Authors
0
1
Name
Order
Citations
PageRank
Stuart W. Margolis110218.14