Abstract
In this paper, a solid code is introduced and disjunctive domain is defined as a language by which one can determined whether a given language is disjunctive or not. Some properties of solid codes were investigated. We show that a solid code consists of only primitive words. A characterization of disjunctive domains is obtained.
Similar content being viewed by others
References
Lallement, G.,Semigroups and Combinatorial Applications, John Wiley and Sons., New York (1979).
Shyr, H.J.,Disjunctive Languages on a Free Monoid, Information and Control34 (1977) 123–129.
Shyr, H.J.,Free Monoids and Languages, Lecture Notes, Department of Mathematics, Soochow University, Taipei (1979).
Shyr, H.J.,Ordered Catenation and Regular Free Disjunctive Languages, Information and Control,46 (1980) 257–269.
Shyr, H.J. and Tseng, D.C.,Some Properties of Dense Languages, Soochow Journal of Mathematics,10 (1984) 127–131.
Ito M. and Shyr, H.J.,Regular Domains, Journal of Information Processing EIK,23 (1987) 2/3, 67–80.
Author information
Authors and Affiliations
Additional information
Communicated by Boris M. Schein
The author would like to thank the referee for his valuable suggestions
Rights and permissions
About this article
Cite this article
Shyr, H.J., Yu, S.S. Solid codes and disjunctive domains. Semigroup Forum 41, 23–37 (1990). https://doi.org/10.1007/BF02573375
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02573375