Inductive inference of context-free languages based on context-free expressions

References

• Angluin , D. 1978 . On the complexity of minimum inference of regular sets . Inf. and Contr. , 39 : 337 – 350 .
   Google Scholar
• Angluin D. Learning regular sets from queries and counter-examples Technical Report 464 Dept. of Comput. Sci. Yale University 1986
   Google Scholar
• Biermann , A. W. 1972 . Proc. of the First USA-Japan Comput. Conf. . An interactive finite-state languages learner . 1972 . pp. 13 – 20 .
   Google Scholar
• Brzozowski , Y. A. 1968 . Regular-like expressions for some irregular languages . IEEE Conf. record of 9th Ann. Symp. on Switching and Automata Theory , : 278 – 280 .
   Google Scholar
• Enomoto , H. and Tomita , E. 1976 . A representative set of deterministic finite auto-mata . Transactions of IECE , 59-D ( 9 ) : 660 – 667 . in Japanese
   Google Scholar
• Gold , E. M. 1967 . Language identification in the limit . Inf. and Contr. , 10 ( 9 ) : 447 – 474 .
   Google Scholar
• Gold , E. M. 1978 . Complexity of automaton identification from given data . Inf. and Contr. , 37 ( 9 ) : 302 – 320 .
   Google Scholar
• Gruska , J. 1971 . A characterization of context-free languages . J. of Comput. and Sys. Sci. , 5 ( 9 ) : 353 – 364 .
   Google Scholar
• Ginsburg , S. and Spanier , E. H. 1968 . Derivation-bounded languages . J. of Comput. and Sys. Sci. , 2 ( 9 ) : 228 – 250 .
   Google Scholar
• Hopcroft , J. E. and Ullman , J. D. 1969 . Formal languages and their relation to automata , Addison-Wesley .
   Google Scholar
• Ishizaka , H. 1986 . Proc. of Symp. on Software Sci. and Engineering . Model inference incorporating generalization . Sept 1986 , Kyoto.
   Google Scholar
• Kitagawa T. Statistical information in inference process and data analysis Research Report 66 Intern. Inst. for Advanced Study of Soc. Inform. Sci., Fujitsu Limited 1986
   Google Scholar
• Knobe , B. and Knobe , K. 1976 . A method for inferring context-free grammars . Inf. and Contr. , 31 Sept : 129 – 149 .
   Google Scholar
• Laird P. D. Inductive inference by refinement Dept. of Comput. Sci., Yale University 1986
   Google Scholar
• Salomaa , A. 1973 . Formal languages , Academic Press .
   Google Scholar
• Shapiro E. Inductive inference of theories from facts Technical Report 192 Dept. of Comput. Sci., Yale University 1981
   Google Scholar
• Shapiro E. Algorithmic program debugging Ph.D dissertation, Dept. of Comput. Sci., Yale University MIT Press 1982 also published by
   Google Scholar
• Shinohara , T. 1983 . Polynomial time inference of extended regular pattern languages . Lecture Notes in Comput. Sci. , 147 : 115 – 127 . Springer-Verlag
   Google Scholar
• Tanatsugu , K. 1987 . A grammatical inference based on self-embedding for context-free languages . Bulletin of Informatics and Cybernetics , 22 ( 3-4 ) : 149 – 163 .
   Google Scholar
• Tanatsugu , K. and Arikawa , S. 1977 . On characteristic sets and degrees of finite automata . Intern, J. of Comput. and Inf. Sci. , 6 ( 1 ) : 83 – 93 .
   Google Scholar
• Valiant , L. G. 1984 . A theory of the learnable . CACM , 27 ( 11 ) : 1134 – 1142 .
   Web of Science ®Google Scholar
• Wharton , R. M. 1977 . Grammar enumeration and inference . Inf. and Contr. , 33 ( 11 ) : 252 – 272 .
   Google Scholar
• Yokomori T. Inductive inference of context-free languages—Context-free expression method Research Report 71, Intern. Inst. for Advanced Study of Soc. Inform. Sci. Fujitsu Limited 1986
   Google Scholar