{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:48Z","timestamp":1725771468205},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_43","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T08:52:25Z","timestamp":1391590345000},"page":"528-540","source":"Crossref","is-referenced-by-count":2,"title":["Distinguishing Pattern Languages with Membership Examples"],"prefix":"10.1007","author":[{"given":"Zeinab","family":"Mazadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci.\u00a021, 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037183","volume":"11","author":"S. Arikawa","year":"1993","unstructured":"Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., Shinohara, T.: A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Comput.\u00a011, 361\u2013375 (1993)","journal-title":"New Generation Comput."},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-40935-6_13","volume-title":"Algorithmic Learning Theory","author":"M. Darnst\u00e4dt","year":"2013","unstructured":"Darnst\u00e4dt, M., Doliwa, T., Simon, H.U., Zilles, S.: Order compression schemes. In: Jain, S., Munos, R., Stephan, F., Zeugmann, T. (eds.) ALT 2013. LNCS, vol.\u00a08139, pp. 173\u2013187. Springer, Heidelberg (2013)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-16108-7_19","volume-title":"Algorithmic Learning Theory","author":"T. Doliwa","year":"2010","unstructured":"Doliwa, T., Simon, H.U., Zilles, S.: Recursive teaching dimension, learning complexity, and maximum classes. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) Algorithmic Learning Theory. LNCS, vol.\u00a06331, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-38905-4_10","volume-title":"Combinatorial Pattern Matching","author":"H. Fernau","year":"2013","unstructured":"Fernau, H., Schmid, M.L.: Pattern matching with variables: A multivariate complexity analysis. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 83\u201394. Springer, Heidelberg (2013)"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ic.2009.04.002","volume":"208","author":"D.D. Freydenberger","year":"2010","unstructured":"Freydenberger, D.D., Reidenbach, D.: Bad news on decision problems for patterns. Inf. Comput.\u00a0208, 83\u201396 (2010)","journal-title":"Inf. Comput."},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.jcss.2012.10.001","volume":"79","author":"D.D. Freydenberger","year":"2013","unstructured":"Freydenberger, D.D., Reidenbach, D.: Inferring descriptive generalisations of formal languages. J. Comp. Sys. Sci.\u00a079, 622\u2013639 (2013)","journal-title":"J. Comp. Sys. Sci."},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-24412-4_10","volume-title":"Algorithmic Learning Theory","author":"M. Geilke","year":"2011","unstructured":"Geilke, M., Zilles, S.: Learning relational patterns. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol.\u00a06925, pp. 84\u201398. Springer, Heidelberg (2011)"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-28332-1_24","volume-title":"Language and Automata Theory and Applications","author":"M. Geilke","year":"2012","unstructured":"Geilke, M., Zilles, S.: Polynomial-time algorithms for learning typed pattern languages. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 277\u2013288. Springer, Heidelberg (2012)"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1995.1003","volume":"50","author":"S.A. Goldman","year":"1995","unstructured":"Goldman, S.A., Kearns, M.J.: On the complexity of teaching. J. Comput. Syst. Sci.\u00a050, 20\u201331 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1016\/j.ipl.2010.09.010","volume":"110","author":"S. Jain","year":"2010","unstructured":"Jain, S., Ong, Y.S., Stephan, F.: Regular patterns, regular languages and context-free languages. Inf. Process. Lett.\u00a0110, 1114\u20131119 (2010)","journal-title":"Inf. Process. Lett."},{"key":"43_CR12","unstructured":"Mazadi, Z.: Learning pattern languages from a small number of helpfully chosen examples, M.Sc. Thesis, University of Regina (2013)"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1145\/4472.4476","volume":"7","author":"R.P. Nix","year":"1985","unstructured":"Nix, R.P.: Editing by example. ACM Trans. Program. Lang. Syst.\u00a07, 600\u2013621 (1985)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-642-28332-1_40","volume-title":"Language and Automata Theory and Applications","author":"D. Reidenbach","year":"2012","unstructured":"Reidenbach, D., Schmid, M.L.: Patterns with bounded treewidth. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 468\u2013479. Springer, Heidelberg (2012)"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-31653-1_13","volume-title":"Developments in Language Theory","author":"D. Reidenbach","year":"2012","unstructured":"Reidenbach, D., Schmid, M.L.: Regular and context-free pattern languages over small alphabets. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 130\u2013141. Springer, Heidelberg (2012)"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF03037091","volume":"8","author":"A. Shinohara","year":"1991","unstructured":"Shinohara, A., Miyano, S.: Teachability in computational learning. New Generation Comput.\u00a08, 337\u2013347 (1991)","journal-title":"New Generation Comput."},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"43_CR18","first-page":"349","volume":"12","author":"S. Zilles","year":"2011","unstructured":"Zilles, S., Lange, S., Holte, R., Zinkevich, M.: Models of cooperative teaching and learning. J. Mach. Learn. Res.\u00a012, 349\u2013384 (2011)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:49:41Z","timestamp":1558835381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}