Inferring regular languages by merging nonterminals

References

• Ahonen , H. 1996 . “ Generating grammars for structured documents using grammatical inference methods ” . In Ph.D. Thesis , University of Helsinki . Department of Computer Science~,,~Report A-1996-4
   Google Scholar
• Angluin , D. 1980 . Finding patterns common to a string . J. Comput. Syst. Set , 21 : 46 – 62 .
   Google Scholar
• Angluin , D. 1982 . Inference of reversible languages . J. ACM , 29 : 741 – 765 .
   Web of Science ®Google Scholar
• Angluin , D. and Smith , C.H. 1983 . Inductive inference: theory and methods . ACM Comput. Surv , 15 : 237 – 269 .
   Web of Science ®Google Scholar
• Crespi-Reghizzi , S. , Guida , G. and Mandrioli , D. 1978 . Noncounting context-free languages . J. ACM , 25 : 571 – 580 .
   Google Scholar
• Emerald , J.D. , Subramanian , K.G. and Thomas , D.G. . Learning code regular and code linear languages . Proceedings of ICGI-96, Lecture Notes tit Artificial Intelligence . Vol. 1147 , pp. 211 – 221 .
   Google Scholar
• Gabow , H.N. and Tarjan , R.E. A linear-time algorithm for a special case of disjoint set union . Proc. 15th ACM Symposium on Theory of Computing . pp. 246 – 251 .
   Google Scholar
• Garcia , P. , Vidal , E. and Oncina , J. Learning locally testable languages in the strict sense . Proceedings of the First International Workshop on Algorithmic Learning Theory . pp. 325 – 338 .
   Google Scholar
• Gold , E.M. 1967 . Language identification in the limit . Inform. Contr.t , 10 : 447 – 474 .
   Google Scholar
• Harrison , M.A. 1978 . Introduction to Formal Language Theory , Addison-Wesley .
   Google Scholar
• Mäkinen , E. 1985 . On context-free derivations . Acta Univ, Tamper. Ser. A , 198
   Google Scholar
• Mäkinen , E. 1990 . The grammatical inference problem for the Szilard languages of linear grammars . Inf Process. Lett , 36 : 203 – 206 .
   Google Scholar
• Mäkinen , E. 1996 . A family of languages which is polynomial-time learnable from positive data in Pitt's sense . Int. J. Computer Math , 61 : 175 – 179 .
   Web of Science ®Google Scholar
• Mäkinen , E. 1997 . Inferring uniquely terminating regular languages from positive data . Inf. Process, Lett , 62 : 57 – 60 .
   Web of Science ®Google Scholar
• Muggleton , S. 1990 . Inductive Acquisition of Expert Knowledge , Addison-Wesley .
   Google Scholar
• Pitt , L. . Inductive inference, DFAs, and computational complexity . Proceedings of 2nd Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence . Vol. 397 , pp. 18 – 44 .
   Google Scholar
• Salomaa , A. 1981 . Jewels of Formal Language Theory , Computer Science Press .
   Google Scholar
• Tanida , N. and Yokomori , T. 1992 . Polynomial-time identification of strictly regular languages in the limit . IEICE Trans. Inf and Syst , : 125 – 132 . E75-D
   Google Scholar
• Tarjan , R.E. and Van Leeuwen , J. 1984 . Worst-case analysis of set union algorithms . J. ACM , 31 : 245 – 281 .
   Web of Science ®Google Scholar
• Yokomori , T. 1995 . On polynomial-time learnability in the limit of strictly regular languages . Machine Learning , 19 : 153 – 179 .
   Google Scholar