{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:41:41Z","timestamp":1725910901333},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319677286"},{"type":"electronic","value":"9783319677293"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67729-3_11","type":"book-chapter","created":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T01:04:04Z","timestamp":1505523844000},"page":"174-191","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Time Learner for Inferring Subclasses of Internal Contextual Grammars with Local Maximum Selectors"],"prefix":"10.1007","author":[{"given":"Abhisek","family":"Midya","sequence":"first","affiliation":[]},{"given":"D. G.","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Saleem","family":"Malik","sequence":"additional","affiliation":[]},{"given":"Alok Kumar","family":"Pani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0010-0277(93)90022-N","volume":"46","author":"GF Marcus","year":"1993","unstructured":"Marcus, G.F.: Negative evidence in language acquisition. Cognition 46, 53\u201385 (1993)","journal-title":"Cognition"},{"key":"11_CR2","unstructured":"Oates, T., Desai, D., Bhat, V.: Learning k-reversible context-free grammars from positive structural examples. In: Proceedings of the Nineteenth International Conference on Machine Learning (2002)"},{"key":"11_CR3","unstructured":"Oates, T., Armstrong, T., Harris, J., Nejman, M.: On the relationship between lexical semantics and syntax for the inference of context-free grammars. In: Proceedings of AAAI, pp. 431\u2013436 (2004)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215\u2013267. Springer, Heidelberg (1997). doi: 10.1007\/978-3-642-59126-6_4"},{"key":"11_CR5","first-page":"229","volume":"1","author":"A Rosenfeld","year":"1993","unstructured":"Rosenfeld, A., Sironmoney, R.: Picture languages - a survey. Lang. Des. 1, 229\u2013245 (1993)","journal-title":"Lang. Des."},{"key":"11_CR6","unstructured":"Haussler, D.: Insertion and iterated insertion as operations on formal languages. Ph.D. Thesis, University of Colorado, Boulder (1982)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"1","author":"L Kari","year":"1996","unstructured":"Kari, L.: Contextual insertions\/deletions and computability. Inf. Comput. 1, 47\u201361 (1996)","journal-title":"Inf. Comput."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11872436_12","volume-title":"Grammatical Inference: Algorithms and Applications","author":"T Oates","year":"2006","unstructured":"Oates, T., Armstrong, T., Bonache, L.B., Atamas, M.: Inferring grammars for mildly context sensitive languages in polynomial-time. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS, vol. 4201, pp. 137\u2013147. Springer, Heidelberg (2006). doi: 10.1007\/11872436_12"},{"issue":"10","key":"11_CR9","first-page":"1525","volume":"14","author":"S Marcus","year":"1969","unstructured":"Marcus, S.: Contextual grammars. Revue Roumane de Mathematiques Pures et appliques 14(10), 1525\u20131534 (1969)","journal-title":"Revue Roumane de Mathematiques Pures et appliques"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-45257-7_6","volume-title":"Grammatical Inference: Algorithms and Applications","author":"JD Emerald","year":"2000","unstructured":"Emerald, J.D., Subramanian, K.G., Thomas, D.G.: Inferring subclasses of contextual languages. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS, vol. 1891, pp. 65\u201374. Springer, Heidelberg (2000). doi: 10.1007\/978-3-540-45257-7_6"},{"key":"11_CR11","unstructured":"Ilie, L.: Some recents results on contextual languages. TUCS Technical report No 96 (1997)"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10, 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-07675-0_6","volume-title":"Handbook of Formal Language","author":"A Ehrenfeucht","year":"1997","unstructured":"Ehrenfeucht, A., Paun, G., Rozenberg, G.: Contextual grammars and formal languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language, vol. 2, pp. 237\u2013293. Springer, Heidelberg (1997). doi: 10.1007\/978-3-662-07675-0_6"},{"key":"11_CR14","first-page":"159","volume":"64","author":"H Fernau","year":"2005","unstructured":"Fernau, H., Freund, R., Holzer, M.: Representations of recursively enumerable array languages by contextual array grammars. Fundamenta Informatica 64, 159\u2013170 (2005)","journal-title":"Fundamenta Informatica"},{"key":"11_CR15","unstructured":"Martin-Vide, C., Mateescu, A., Miguel-Verges, J., Paun, G.: Internal contextual grammars: minimal, maximal, and scattered use of selectors. In: Kappel, M., Sgamir, E. (eds.) Bisfai 95 Conference on Natural Languages and AI, Jerusalem, pp. 132\u2013142 (1995)"},{"issue":"298","key":"11_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(02)00423-1","volume":"1","author":"T Yokomori","year":"2003","unstructured":"Yokomori, T.: Polynomial-time identification algorithm of very simple grammars from positive data. Theor. Comput. Sci. 1(298), 179\u2013206 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1142\/S0218001400000349","volume":"14","author":"R Rama","year":"2000","unstructured":"Rama, R., Smitha, T.A.: Some results on array contextual grammars. Int. J. Pattern Recogn. Artif. Intell. 14, 537\u2013550 (2000)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67729-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T15:44:43Z","timestamp":1602949483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67729-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319677286","9783319677293"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67729-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}