{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:57:23Z","timestamp":1742929043796,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360886"},{"type":"electronic","value":"9783642360893"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36089-3_12","type":"book-chapter","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T01:13:00Z","timestamp":1357780380000},"page":"204-223","source":"Crossref","is-referenced-by-count":8,"title":["Grammatical Inference in Software Engineering: An Overview of the State of the Art"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Stevenson","sequence":"first","affiliation":[]},{"given":"James R.","family":"Cordy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"STUDFUZZ","first-page":"187","volume-title":"Computational grammatical inference","author":"P. Adriaans","year":"2006","unstructured":"Adriaans, P., van Zaanen, M.: Computational grammatical inference. STUDFUZZ, vol.\u00a0194, pp. 187\u2013203. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045(2), 117\u2013135 (1980)","journal-title":"Information and Control"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control\u00a051(1), 76\u201387 (1981)","journal-title":"Information and Control"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. Journal of the ACM (JACM)\u00a029, 741\u2013765 (1982)","journal-title":"Journal of the ACM (JACM)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"issue":"4","key":"12_CR6","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02(4), 319\u2013342 (1988)","journal-title":"Machine Learning"},{"issue":"2","key":"12_CR7","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D.: Negative results for equivalence queries. Machine Learning\u00a05(2), 121\u2013150 (1990)","journal-title":"Machine Learning"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/103418.103420","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991","author":"D. Angluin","year":"1991","unstructured":"Angluin, D., Kharitonov, M.: When won\u2019t membership queries help? In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 444\u2013454. ACM, New York (1991)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Ates, K., Kukluk, J., Holder, L., Cook, D., Zhang, K.: Graph grammar induction on structural data for visual programming. In: 18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006, pp. 232\u2013242 (November 2006)","DOI":"10.1109\/ICTAI.2006.61"},{"issue":"9","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1016\/j.patcog.2004.03.027","volume":"38","author":"M. Bugalho","year":"2005","unstructured":"Bugalho, M., Oliveira, A.L.: Inference of regular languages using state merging algorithms with search. Pattern Recogn.\u00a038(9), 1457\u20131467 (2005)","journal-title":"Pattern Recogn."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/180139.181075","volume-title":"Proceedings of the Seventh Annual Conference on Computational Learning Theory, COLT 1994","author":"A. Burago","year":"1994","unstructured":"Burago, A.: Learning structurally reversible context-free grammars from queries and counterexamples in polynomial time. In: Proceedings of the Seventh Annual Conference on Computational Learning Theory, COLT 1994, pp. 140\u2013146. ACM, New York (1994)"},{"key":"12_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-45790-9_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Cano","year":"2002","unstructured":"Cano, A., Ru\u00edz, J., Garc\u00eda, P.: Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 28\u201336. Springer, Heidelberg (2002)"},{"key":"12_CR13","first-page":"603","volume":"4","author":"O. Cicchello","year":"2003","unstructured":"Cicchello, O., Kremer, S.C.: Inducing grammars from sparse data sets: a survey of algorithms and results. J. Mach. Learn. Res.\u00a04, 603\u2013632 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-15488-1_4","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"A. Clark","year":"2010","unstructured":"Clark, A.: Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol.\u00a06339, pp. 24\u201337. Springer, Heidelberg (2010)"},{"key":"12_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-88009-7_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Clark","year":"2008","unstructured":"Clark, A., Eyraud, R., Habrard, A.: A Polynomial Algorithm for the Inference of Context Free Languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol.\u00a05278, pp. 29\u201342. Springer, Heidelberg (2008)"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/322092.322098","volume":"25","author":"S. Crespi-Reghizzi","year":"1978","unstructured":"Crespi-Reghizzi, S., Guida, G., Mandrioli, D.: Noncounting context-free languages. Journal of the ACM (JACM)\u00a025(4), 571\u2013580 (1978)","journal-title":"Journal of the ACM (JACM)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/361952.361958","volume":"16","author":"S. Crespi-Reghizzi","year":"1973","unstructured":"Crespi-Reghizzi, S., Melkanoff, M.A., Lichten, L.: The use of grammatical inference for designing programming languages. Communications of the ACM\u00a016, 83\u201390 (1973)","journal-title":"Communications of the ACM"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-44522-6_3","volume-title":"Advances in Pattern Recognition","author":"C. de la Higuera","year":"2000","unstructured":"de la Higuera, C.: Current Trends in Grammatical Inference. In: Amin, A., Pudil, P., Ferri, F., I\u00f1esta, J.M. (eds.) SSPR&SPR 2000. LNCS, vol.\u00a01876, pp. 28\u201331. Springer, Heidelberg (2000)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C. de la Higuera","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition\u00a038, 1332\u20131348 (2005)","journal-title":"Pattern Recognition"},{"key":"12_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11872436_4","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. de la Higuera","year":"2006","unstructured":"de la Higuera, C.: Ten Open Problems in Grammatical Inference. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 32\u201344. Springer, Heidelberg (2006)"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1049\/iet-sen:20070061","volume":"2","author":"A. Dubey","year":"2008","unstructured":"Dubey, A., Jalote, P., Aggarwal, S.: Learning context-free grammar rules from a set of programs. Software. IET\u00a02(3), 223\u2013240 (2008)","journal-title":"IET"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TPAMI.1986.4767796","volume":"8","author":"K.S. Fu","year":"1986","unstructured":"Fu, K.S., Booth, T.L.: Grammatical inference: introduction and survey\/part i. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a08, 343\u2013359 (1986)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"F\u00fcrst, L., Mernik, M., Mahnic, V.: Graph grammar induction as a parser-controlled heuristic search process, Budapest, Hungary (October 2011)","DOI":"10.1007\/978-3-642-34176-2_12"},{"issue":"5","key":"12_CR24","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Hrn\u010di\u010d, D., Mernik, M., Bryant, B.R.: Embedding Dsls Into Gpls: A Grammatical Inference Approach. Information Technology and Control\u00a040(4) (December 2011)","DOI":"10.5755\/j01.itc.40.4.980"},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1016\/j.asoc.2011.11.024","volume":"12","author":"D. Hrn\u010di\u010d","year":"2012","unstructured":"Hrn\u010di\u010d, D., Mernik, M., Bryant, B.R., Javed, F.: A memetic grammar inference algorithm for language learning. Applied Soft Computing\u00a012(3), 1006\u20131020 (2012)","journal-title":"Applied Soft Computing"},{"issue":"2","key":"12_CR28","first-page":"151","volume":"5","author":"H. Ishizaka","year":"1990","unstructured":"Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning\u00a05(2), 151\u2013164 (1990)","journal-title":"Machine Learning"},{"key":"12_CR29","unstructured":"Javed, F., Mernik, M., Bryant, B.R., Gray, J.: A grammar-based approach to class diagram validation (2005)"},{"issue":"9-10","key":"12_CR30","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.infsof.2007.08.003","volume":"50","author":"F. Javed","year":"2008","unstructured":"Javed, F., Mernik, M., Gray, J., Bryant, B.R.: MARS: a metamodel recovery system using grammar inference. Inf. Softw. Technol.\u00a050(9-10), 948\u2013968 (2008)","journal-title":"Inf. Softw. Technol."},{"key":"12_CR31","unstructured":"Javed, F., Mernik, M., Sprague, A., Bryant, B.: Incrementally inferring context-free grammars for domain-specific languages. In: Proceedings of the Eighteenth International Conference on Software Engineering and Knowledge Engineering (SEKE 2006), pp. 363\u2013368 (2006)"},{"key":"12_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0054070","volume-title":"Grammatical Inference","author":"H. Juill\u00e9","year":"1998","unstructured":"Juill\u00e9, H., Pollack, J.B.: A Stochastic Search Approach to Grammar Induction. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, p. 126. Springer, Heidelberg (1998)"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/28395.28426","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., Valiant, L.: On the learnability of boolean formulae. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 285\u2013295. ACM, New York (1987)"},{"key":"12_CR34","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45790-9_13","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Kermorvant","year":"2002","unstructured":"Kermorvant, C., de la Higuera, C.: Learning Languages with Help. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 161\u2013173. Springer, Heidelberg (2002)"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Kong, J., Ates, K., Zhang, K., Gu, Y.: Adaptive mobile interfaces through grammar induction. In: 20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2008, vol.\u00a01, pp. 133\u2013140 (November 2008)","DOI":"10.1109\/ICTAI.2008.41"},{"issue":"15","key":"12_CR36","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1002\/spe.423","volume":"31","author":"R. L\u00e4mmel","year":"2001","unstructured":"L\u00e4mmel, R., Verhoef, C.: Semi-automatic grammar recovery. Softw. Pract. Exper.\u00a031(15), 1395\u20131448 (2001)","journal-title":"Softw. Pract. Exper."},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-00255-7_17","volume-title":"Integrated Formal Methods","author":"R. L\u00e4mmel","year":"2009","unstructured":"L\u00e4mmel, R., Zaytsev, V.: An Introduction to Grammar Convergence. In: Leuschel, M., Wehrheim, H. (eds.) IFM 2009. LNCS, vol.\u00a05423, pp. 246\u2013260. Springer, Heidelberg (2009)"},{"key":"12_CR38","unstructured":"Lang, K.J.: Faster algorithms for finding minimal consistent DFAs. Technical report (1999)"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Proceedings of the 4th International Colloquium on Grammatical Inference","author":"K.J. Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Proceedings of the 4th International Colloquium on Grammatical Inference, pp. 1\u201312. Springer, London (1998)"},{"key":"12_CR40","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-45164-1_23","volume-title":"Machine Learning: ECML 2000","author":"P. Langley","year":"2000","unstructured":"Langley, P., Stromsten, S.: Learning Context-Free Grammars with a Simplicity Bias. In: Lopez de Mantaras, R., Plaza, E. (eds.) ECML 2000. LNCS (LNAI), vol.\u00a01810, pp. 220\u2013228. Springer, Heidelberg (2000)"},{"key":"12_CR41","first-page":"259","volume-title":"ACM SIGPLAN Notices, PLDI 1999","author":"J.R. Larus","year":"1999","unstructured":"Larus, J.R.: Whole program paths. In: ACM SIGPLAN Notices, PLDI 1999, pp. 259\u2013269. ACM, New York (1999)"},{"key":"12_CR42","unstructured":"Lee, L.: Learning of context-free languages: A survey of the literature. REP, 12\u201396 (1996)"},{"key":"12_CR43","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1137\/0220056","volume":"20","author":"M. Li","year":"1991","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: Learning simple concepts under simple distributions. SIAM Journal of Computing\u00a020, 911\u2013935 (1991)","journal-title":"SIAM Journal of Computing"},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/COMPSAC.2010.35","volume-title":"Proceedings of the 2010 IEEE 34th Annual Computer Software and Applications Conference, COMPSAC 2010","author":"Q. Liu","year":"2010","unstructured":"Liu, Q., Bryant, B.R., Mernik, M.: Metamodel recovery from multi-tiered domains using extended MARS. In: Proceedings of the 2010 IEEE 34th Annual Computer Software and Applications Conference, COMPSAC 2010, pp. 279\u2013288. IEEE Computer Society, Washington, DC (2010)"},{"key":"12_CR45","unstructured":"Memon, A.U.: Log File Categorization and Anomaly Analysis Using Grammar Inference. Master of science, Queen\u2019s University (2008)"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Mernik, M., Hrn\u010di\u010d, D., Bryant, B., Sprague, A., Gray, J., Liu, Q., Javed, F.: Grammar inference algorithms and applications in software engineering. In: XXII International Symposium on Information, Communication and Automation Technologies, ICAT 2009., pp. 1\u20137 (October 2009)","DOI":"10.1109\/ICAT.2009.5348441"},{"issue":"1","key":"12_CR47","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C.G. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. Journal of Artificial Intelligence Research\u00a07(1), 67\u201382 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garc\u00eda, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition - Proceedings of the International Workshop on Structural and Syntactic Pattern Recognition, Bern, Switzerland, pp. 99\u2013108 (1992)","DOI":"10.1142\/9789812797919_0007"},{"issue":"4","key":"12_CR49","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. Journal of the ACM (JACM)\u00a035(4), 965\u2013984 (1988)","journal-title":"Journal of the ACM (JACM)"},{"key":"12_CR50","unstructured":"Ron, D.: Automata Learning and its Applications. PhD thesis, Hebrew University (1995)"},{"issue":"2-3","key":"12_CR51","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science\u00a076(2-3), 223\u2013242 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR52","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0890-5401(92)90003-X","volume":"97","author":"Y. Sakakibara","year":"1992","unstructured":"Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Information and Computation\u00a097(1), 23\u201360 (1992)","journal-title":"Information and Computation"},{"key":"12_CR53","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0304-3975(97)00014-5","volume":"185","author":"Y. Sakakibara","year":"1997","unstructured":"Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science\u00a0185, 15\u201345 (1997)","journal-title":"Theoretical Computer Science"},{"key":"12_CR54","volume-title":"Finite Automata: Behaviour and Synthesis","author":"B.A. Trakhtenbrot","year":"1973","unstructured":"Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata: Behaviour and Synthesis. North-Holland Publishing Company, Amsterdam (1973)"},{"key":"12_CR55","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"issue":"4","key":"12_CR56","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.entcs.2005.02.055","volume":"141","author":"M. \u010crepin\u0161ek","year":"2005","unstructured":"\u010crepin\u0161ek, M., Mernik, M., Bryant, B.R., Javed, F., Sprague, A.: Inferring context-free grammars for domain-specific languages. Electronic Notes in Theoretical Computer Science\u00a0141(4), 99\u2013116 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"12_CR57","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1064165.1064172","volume":"40","author":"M. \u010crepin\u0161ek","year":"2005","unstructured":"\u010crepin\u0161ek, M., Mernik, M., Javed, F., Bryant, B.R., Sprague, A.: Extracting grammar from programs: evolutionary approach. ACM SIGPLAN Notices\u00a040, 39\u201346 (2005)","journal-title":"ACM SIGPLAN Notices"},{"key":"12_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58473-0_131","volume-title":"Grammatical Inference and Applications","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: Grammatical Inference: An Introductory Survey. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 1\u20134. Springer, Heidelberg (1994)"},{"key":"12_CR59","first-page":"213","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"T. Yokomori","year":"1991","unstructured":"Yokomori, T.: Polynomial-time learning of very simple grammars from positive data. In: Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pp. 213\u2013227. Morgan Kaufmann Publishers Inc., San Francisco (1991)"},{"issue":"2","key":"12_CR60","first-page":"153","volume":"19","author":"T. Yokomori","year":"1995","unstructured":"Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning\u00a019(2), 153\u2013179 (1995)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Software Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36089-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T15:23:36Z","timestamp":1706196216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36089-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360886","9783642360893"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36089-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}