Abstract
A language in which every word can be found as a subword is called a dense language. A language whose principal congruence is the identity is called a disjunctive language. We also define right (left) dense languages and right (left) disjunctive languages. In this paper, we investigate several properties of dense (right dense, left dense) and disjunctive (right disjunctive, left disjunctive) languages.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Berard: Literal shuffle. Theoret. Compt. Sci. 51, 281–299 (1987)
J. Berstel, D. Perrin: Theory of codes. New York: Academic 1985
A.H. Clifford, G.B. Preston: Algebraic theory of semigroups Vol. 1. Providence, R.I.: Amer. Math. Soc. 1961
J. Dassow, M. Ito, G. Paun: On the subword density of languages, submitted
J. Dassow, G. Paun: Regulated rewriting in formal languages theory. Berlin-Heidelberg: Springer 1989
S. Eilenberg: Automata, languages and machines Vol. A. New York: Academic 1974
J.E. Hopcroft, F.D. Ullman: Introduction to automata theory, languages, and computation. Reading, Mass.: Addison-Wesley 1979
M. Ito, M. Katsura: Context-free languages consisting of non-primitive words. Intern. J. Computer Math. 40, 157–168 (1991)
M. Ito, M. Katsura: Dense languages and languages related to primitive words. In: L. Zhong, K.P. Shum, C.C. Yang & Y. Le (eds.): Proceedings of Asian Mathematical Conference 1990. Singapore: World Scientific 1992, pp. 215–220
M. Ito, M. Katsura, H.J. Shyr: Relations between recognizable languages and disjunctive languages. preprint
M. Ito, C.M. Reis: Left dense covers of languages. In: M. Ito (ed.): Words, Languages and Combinatorics. Singapore: World Scientific 1992, pp. 202–218
M. Ito, G. Tanaka: Dense properties of initial literal shuffles. Intern. J. Computer Math. 34, 161–170 (1990)
M. Ito, G. Thierrin, S.S. Yu, Right k-dense languages. submitted
G. Lallement: Semigroups and Combinatorial Applications. New York: John Wiley & Sons 1979
M. Lothaire: Combinatorics on Words. Reading, Mass.: Addison-Wesley 1983
A. Salomaa: Jewels of formal language theory. London: Pitman 1981
H.J. Shyr: Disjunctive language on a free monoid. Inf. and Contr. 34, 123–129 (1977)
H.J. Shyr: Free monoids and lanpages. Taichung: Hon Min Book 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, M. (1993). Dense and disjunctive properties of languages. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive