A note on grammatical inference of slender context-free languages

  • Yuji Takada
  • Taishin Y. Nishida
Session: Algebraic Methods and Algorithms 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1147)


In this paper, we consider the grammatical inference problem of slender context-free languages from the point of view of cryptosystems. We show that the inference problem of slender context-free languages is not hard, and therefore, the languages have some weakness as cryptosystems. Then, we propose a hierarchical construction of families of slender languages by using some type of linear grammars and slender context-free languages. This makes the grammatical inference problem of those families harder, and therefore, the cryptosystems using our method become safer.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Andraşiu, G. Păun, J. Dassow, and A. Salomaa. Language-theoretic problems arising from Richelieu cryptosystems. Theoretical Comput. Sci., 116:339–357, 1993.CrossRefGoogle Scholar
  2. 2.
    D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117–135, 1980.CrossRefGoogle Scholar
  3. 3.
    J. Dassow and G. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1989.Google Scholar
  4. 4.
    M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978.Google Scholar
  5. 5.
    L. Ilie. On a conjecture about slender context-free languages. Theoretical Comput. Sci., 132(1–2):427–434, 1994.CrossRefGoogle Scholar
  6. 6.
    N. A. Khabbaz. A geometric hierarchy of languages. Journal of Computer and System Sciences, 8:142–157, 1974.Google Scholar
  7. 7.
    T. Koshiba, E. Mäkinen, and Y. Takada. Learning deterministic even linear languages from positive examples. To appear in Theoretical Computer Science.Google Scholar
  8. 8.
    T. Y. Nishida and A. Salomaa. Slender 01 languages. Theoretical Comput. Sci., 158(1–2):161–176, 1996.CrossRefGoogle Scholar
  9. 9.
    G. Păun and A. Salomaa. Closure properties of slender languages. Theoretical Comput. Sci., 120, 1993.Google Scholar
  10. 10.
    G. Pŭn and A. Salomaa. Thin and slender languages. Discrete Applied Mathematics, 61(3):257–270, 1995.CrossRefGoogle Scholar
  11. 11.
    L. Pitt. Inductive inference, DFAs, and computational complexity. In K. P. Jantke, editor, Proceedings of 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, 397, pages 18–44. Springer-Verlag, 1989.Google Scholar
  12. 12.
    D. Raz. On slender context-free languages. In STACS'95, Lecture Notes in Computer Science, volume 900, pages 445–454. Springer-Verlag, 1995.Google Scholar
  13. 13.
    Y. Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123(1):138–145, 1995.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yuji Takada
    • 1
  • Taishin Y. Nishida
    • 2
  1. 1.Netmedia Lab.Fujitsu Laboratories Ltd.FukuokaJapan
  2. 2.Faculty of EngineeringToyama Prefectural UniversityToyamaJapan

Personalised recommendations