{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:21:18Z","timestamp":1752229278274},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650133"},{"type":"electronic","value":"9783540497301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49730-7_15","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:01:18Z","timestamp":1196330478000},"page":"191-204","source":"Crossref","is-referenced-by-count":5,"title":["Locality, Reversibility, and Beyond: Learning Languages from Positive Data"],"prefix":"10.1007","author":[{"given":"Tom","family":"Head","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yokomori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin, Inductive inference of formal languages from positive data, Information and Control\n                           45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin, Inference of reversible languages, Journal of the ACM\n                           29 (1982) 741\u2013765.","journal-title":"Journal of the ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, A note on two problems in connection with graphs, Numerishe Mathematik, 1 (1959) 269\u2013271.","journal-title":"Numerishe Mathematik"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. Mark Gold, Language identification in the limit, Information and Control, 10 (1967), 447\u2013474.","journal-title":"Information and Control"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bulletin of Mathematical Biology, 49 (1987) 737\u2013759.","journal-title":"Bulletin of Mathematical Biology"},{"unstructured":"T. Head, Splicing representations of strictly locally testable languages, submitted for publication. (1997)","key":"15_CR6"},{"unstructured":"T. Head, Splicing languages generated with one-sided context, submitted for publication. (1997)","key":"15_CR7"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0129054196000221","volume":"7","author":"S. Kobayashi","year":"1996","unstructured":"S. Kobayashi and T. Yokomori, Families of non-counting languages and their learnability from positive data, Intern. Journal of Foundations of Computer Science, 7 309\u2013327 (1996).","journal-title":"Intern. Journal of Foundations of Computer Science"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(96)00224-1","volume":"174","author":"S. Kobayashi","year":"1997","unstructured":"S. Kobayashi and T. Yokomori, Learning approximately regular languages with reversible languages, Theoretical Computer Science, 174 (1997) 251\u2013257.","journal-title":"Theoretical Computer Science"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0019-9958(80)90180-1","volume":"44","author":"A. Luca De","year":"1980","unstructured":"De Luca, A. and A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, 44 (1980) 300\u2013319.","journal-title":"Information and Control"},{"key":"15_CR11","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, Massachusetts (1971)."},{"key":"15_CR12","first-page":"245","volume":"15","author":"M. P. Schutzenberger","year":"1975","unstructured":"M. P. Schutzenberger, Sur certaines operations de fermeture dans les languages rationnels, Symposium Mathematicum, 15 (1975) 245\u2013253.","journal-title":"Symposium Mathematicum"},{"doi-asserted-by":"crossref","unstructured":"T. Yokomori, N. Ishida, and S. Kobayashi, Learning local languages and its application to protein alpha-chain identification, In Proc. of 27th Hawaii Intern. Conf. on System Sciences, IEEE Press, 113\u2013122 (1994).","key":"15_CR13","DOI":"10.1109\/HICSS.1994.323560"},{"key":"15_CR14","first-page":"153","volume":"19","author":"T. Yokomori","year":"1995","unstructured":"T. Yokomori, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning, 19 (1995) 153\u2013179.","journal-title":"Machine Learning"},{"unstructured":"T. Yokomori and S. Kobayashi, Learning local languages and its application to DNA sequence analysis, IEEE Transactions on Pattern Analysis and Machine Intelligence, to appear.","key":"15_CR15"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49730-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T23:31:22Z","timestamp":1551137482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49730-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650133","9783540497301"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-49730-7_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}