Abstract
Let Q be the set of primitive words over a finite alphabet having at least two letters. We prove that Q has two rather strong context-free-like properties. The first one is that Q satisfies the nonempty, strong variant of Bader and Moura's iteration condition, and the second one is that intersecting Q with any member of a special, infinite family of regular languages, we get a context-free language. We also present two further related results. It remains an unsolved problem whether Q is non-context-free (we conjecture this).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bader, C., Moura, A.: A generalization of Ogden's lemma. JACM, 29 (1982), 404–407.
Boasson, L., Horváth, S.: On languages satisfying Ogden's lemma. RAIRO Informatique théorique, 12 (1978), 201–202.
Dassow, J., Horváth, S., Karhumäki, J.: On context-free languages of n-th powers: structure and decidability. Presented at the Conf. Formal Languages, Boolean Functions and Complexity, Comenius Univ., Bratislava, CSSR, 6–10 March, 1989; to appear in Comp. and Artif. Int.
Dömösi, P., Horváth, S., Ito, M.: Formal languages and primitive words. Publ. Math., Debrecen (in print).
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966.
Harrison, M. A.: Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.
Hewett, R., Slutzki, G.: Comparisons between some pumping conditions for context-free languages. Math. Syst. Theo., 21 (1989), 223–233.
Hopcroft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
Horváth, S.: The family of languages satisfying Bar-Hillel's Lemma. RAIRO Informatique théorique, 12 (1978), 193–199.
Horváth, S.: A comparison of iteration conditions on formal languages. Proc. Coll. Algebra, Combinatorics and Logic in Comp. Sci., Györ, Hungary, 1983, Coll. Math. Soc. J. Bolyai, 42, J. Bolyai Math. Soc., Budapest and North-Holland, Amsterdam, 1986, 453–463.
Ito, M., Katsura, M., Shyr, H. J., Yu, S. S.: Automata accepting primitive words. Semigroup Forum, 37 (1988), 45–52.
Ito, M., Katsura, M.: Context-free languages consisting of non-primitive words. Int. Journ. of Comp. Math., 40 (1991), 157–167.
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading, Mass., 1983, and Cambridge Univ. Press, 1984.
Salomaa, A.: Formal Languages. Academic Press, New York, London, 1973.
Shyr, H. J.: Free Monoids and Languages. Lect. Notes, Inst. of Applied Math., National Chung-Hsing Univ., Taichung, Taiwan, R. O. C., 1991.
Sokolowski, S.: A method for proving programming languages non-context-free. Inf. Proc. Lett., 7 (1978), 151–153.
Thue, A.: Über unendliche Zeichenreihen. Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania), Nr. 7. (1906), 1–22.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dömösi, P., Horváth, S., Ito, M., Kászonyi, L., Katsura, M. (1993). Formal languages consisting of primitive words. 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_15
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_15
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