Abstract
Let X be an alphabet contains more than one letter and let X* be the free monoid generated by X. A language S≤X* is right dense if uX*∩S≠ϕ for all u∈X*. The purpose of this paper is to give characterizations of right dense languages.
Similar content being viewed by others
References
Lallement, Gérard,Semigroups and Conbinatorial Applications, John Wiley & Sons. New York (1979).
Reis, C. M. and Shyr, H.J.,Some Properties of Disjunctive Languages on a Free Monoid, Information and Control, Vol. 37, No. 3, (1978) 333–344.
Shyr, H.J.,Disjunctive languages on a Free Monoid, Information and Control, Vol. 34, (1977) 123–129.
Shyr, H.J. and Thierrin G.,Disjunctive Languages and Codes, Fundaments of Computation Theory, proceedings of the 1977 International FCT-Conference, Poznan, Poland, Lecture Notes in Computer Science No. 56, Springer-Verlag (1977) 171–176.
Shyr, H.J.,Free Monoids and Languages, Lecture Notes, Department of Mathematics, Soochow University, Taipei, Taiwan (1979).
Shyr, H.J.,A Characterization of Dense Languages, Semigroup Forum, Vol. 30, (1984) 237–240.
Shyr, H.J. and Tseng, Din-Chang,Some Properities of Dense Languages, Soochow Journal of Mathematics, Vol. 10 (1984) 127–131.
Author information
Authors and Affiliations
Additional information
Communicated by Boris M. Schein
This research has been supported by Grant NSC74-0208-M005-01 R.O.C.
An erratum to this article is available at http://dx.doi.org/10.1007/BF02575546.
Rights and permissions
About this article
Cite this article
Shyr, H.J. Characterizations of right dense languages. Semigroup Forum 33, 23–30 (1986). https://doi.org/10.1007/BF02573179
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02573179