A note on grammatical inference of slender context-free languages
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.
- 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.M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978.Google Scholar
- 6.N. A. Khabbaz. A geometric hierarchy of languages. Journal of Computer and System Sciences, 8:142–157, 1974.Google Scholar
- 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
- 9.G. Păun and A. Salomaa. Closure properties of slender languages. Theoretical Comput. Sci., 120, 1993.Google Scholar
- 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.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