{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:59Z","timestamp":1747546919971},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647768"},{"type":"electronic","value":"9783540687078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054073","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T14:54:16Z","timestamp":1152197656000},"page":"162-174","source":"Crossref","is-referenced-by-count":8,"title":["Learning a subclass of linear languages from positive structural information"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 M.","family":"Sempere","sequence":"first","affiliation":[]},{"given":"G.","family":"Nagaraja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0019-9958(64)90294-3","volume":"7","author":"V. Amar","year":"1964","unstructured":"V. Amar, G. PutzoluOn a Family of Linear Grammars. Information and Control 7 (1964) 283\u2013291.","journal-title":"Information and Control"},{"key":"15_CR2","unstructured":"P. Garc\u00eda Learning k-Testable Tree Sets from positive data. Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n. Universidad Polit\u00e9cnica de Valencia. Technical report DSIC-II\/46\/93. 1993."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1969","unstructured":"E. Mark GoldLanguage Identification in the Limit. Information and Control,10 (1969) 447\u2013474.","journal-title":"Information and Control"},{"key":"15_CR4","unstructured":"M. Harrison Introduction to Formal Language Theory. Addison-Wesley Publishing Company. 1978."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera de la","year":"1997","unstructured":"C. de la HigueraCharacteristic Sets for Polynomial Grammatical Inference. Machine Learning 27 (1997) 125\u2013138.","journal-title":"Machine Learning"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(97)00016-9","volume":"185","author":"T. Koshiba","year":"1997","unstructured":"T. Koshiba, E. M\u00c4kinen, Y. TakadaLearning deterministic even linear languages from positive examples. Theoretical Computer Science 185 (1997) 63\u201397.","journal-title":"Theoretical Computer Science"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(90)90074-8","volume":"36","author":"E. M\u00c4kinen","year":"1990","unstructured":"E. M\u00c4kinenThe grammatical inference problem for the Szilard languages of Linear Grammars. Information Processing Letters 36 (1990) 203\u2013206.","journal-title":"Information Processing Letters"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(92)90124-E","volume":"42","author":"E. M\u00c4kinen","year":"1992","unstructured":"E. M\u00c4kinenOn the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters 42 (1992) 1\u20135.","journal-title":"Information Processing Letters"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(92)90051-V","volume":"44","author":"E. M\u00c4kinen","year":"1992","unstructured":"E. M\u00c4kinenRemarks on the structural grammatical inference problem for context-free grammars. Information Processing Letters 44 (1992) 125\u2013127.","journal-title":"Information Processing Letters"},{"issue":"No.2","key":"15_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/FI-1996-25203","volume":"25","author":"E. M\u00c4kinen","year":"1996","unstructured":"E. M\u00c4kinenA note on the grammatical inference problem for even linear languages. Fundamenta Informaticae 25, No. 2 (1996) 175\u2013181.","journal-title":"Fundamenta Informaticae"},{"key":"15_CR11","volume-title":"Ph.D. Thesis","author":"V. Radhakrishnan","year":"1987","unstructured":"V. RadhakrishnanGrammatical Inference from Positive Data: An Effective Integrated Approach. Ph.D. Thesis. Department of Computer Science and Engineering. HT Bombay. 1987."},{"issue":"No.6","key":"15_CR12","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/TSMC.1987.6499309","volume":"17","author":"V. Radhakrishnan","year":"1987","unstructured":"V. Radhakrishnan and G. NagarajaInference of Regular Grammars via Skeletons. IEEE Trans. on Systems, Man and Cybernetics, 17, No. 6 (1987) 982\u2013992.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"issue":"No.1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0031-3203(88)90071-4","volume":"21","author":"V. Radhakrishnan","year":"1988","unstructured":"V. Radhakrishnan and G. NagarajaInference of Even Linear Languages and Its Application to Picture Description Languages. Pattern Recognition,21, No. 1 (1988) 55\u201362.","journal-title":"Pattern Recognition"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(72)90018-X","volume":"1","author":"G. Rozenberg","year":"1972","unstructured":"G. RozenbergDirect Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. Information Processing Letters 1 (1972) 233\u2013235.","journal-title":"Information Processing Letters"},{"key":"15_CR15","first-page":"180","volume":"862","author":"J. Ruiz","year":"1994","unstructured":"J. Ruiz and P. Garc\u00edaThe algorithms RT and k-TTI: A first comparison. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 180\u2013188. 1994.","journal-title":"LNAI"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Y. SakakibaraLearning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76 (1990) 223\u2013242.","journal-title":"Theoretical Computer Science"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0890-5401(92)90003-X","volume":"97","author":"Y. Sakakibara","year":"1992","unstructured":"Y. SakakibaraEfficient Learning of Context-Free Grammars from Positive Structural Examples. Information and Computation 97 (1992) 23\u201360.","journal-title":"Information and Computation"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"J.M. Sempere and P. Garc\u00eda A Characterization of Even Linear Languages and its Application to the Learning Problem. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 38\u201344. Springer-Verlag. 1994.","DOI":"10.1007\/3-540-58473-0_135"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 M. Sempere and Antonio FosLearning linear grammars from Structural Information. Proceedings of the Third International Colloquium, ICGI-96. LNAI Vol. 1147, pp 126\u2013133. Springer-Verlag. 1996.","DOI":"10.1007\/BFb0033348"},{"issue":"No.1","key":"15_CR20","first-page":"27","volume":"12","author":"Y. Takada","year":"1988","unstructured":"Y. TakadaInferring Parenthesis Linear Grammars Based on Control Sets. Journal of Information Processing, 12, No. 1 (1988) 27\u201333.","journal-title":"Journal of Information Processing"},{"issue":"No.4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(88)90208-6","volume":"28","author":"Y. Takada","year":"1988","unstructured":"Y. TakadaGrammatical Inference for Even Linear Languages based on Control Sets. Information Processing Letters. 28, No. 4 (1988) 193\u2013199.","journal-title":"Information Processing Letters"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/inco.1995.1163","volume":"123","author":"Y. Takada","year":"1995","unstructured":"Y. TakadaA hierarchy of languages families learnable by regular language learning. Information and Computation, 123(1) (1995) 138\u2013145.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T06:57:32Z","timestamp":1587020252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647768","9783540687078"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0054073","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}