{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:06Z","timestamp":1759638666414},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00005-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"323-343","source":"Crossref","is-referenced-by-count":24,"title":["Ordinal mind change complexity of language identification"],"prefix":"10.1016","volume":"220","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00005-5_BIB1","series-title":"2nd European Conf. on Computational Learning Theory","first-page":"99","article-title":"Power of procrastination in inductive inference: How it depends on used ordinal notations","volume":"vol. 904","author":"Ambainis","year":"1995"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB4","first-page":"405","article-title":"Algorithmic learning theory with elementary formal systems","volume":"4","author":"Arikawa","year":"1992","journal-title":"IEICE Trans. Inform. Systems E75-D"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB5","series-title":"2nd Symp. on Mathematical Foundations of Computer Science","first-page":"9","article-title":"The theory of inductive inference","author":"B\u0101rzdi\u0146\u0161","year":"1973"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB6","series-title":"Algorithmic Learning for Knowledge-Based Systems","first-page":"77","article-title":"Not-so-nearly-minimal-size program inference","volume":"vol. 961","author":"Case","year":"1995"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0019-9958(86)80042-0","article-title":"On the complexity of inductive inference","volume":"69","author":"Daley","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/inco.1993.1068","article-title":"On the role of procrastination in machine learning","volume":"107","author":"Freivalds","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB11","series-title":"Proc. 7th Annual Conf. on Computational Learning Theory","first-page":"278","article-title":"On the intrinsic complexity of language identification","author":"Jain","year":"1994"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB12","series-title":"Proc. 9th Annual Conf. on Computational Learning Theory","first-page":"181","article-title":"Elementary formal systems, intrinsic complexity, and procrastination","author":"Jain","year":"1996"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1006\/jcss.1996.0030","article-title":"The intrinsic complexity of language identification","volume":"52","author":"Jain","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/inco.1996.2614","article-title":"Elementary formal systems, intrinsic complexity, and procrastination","volume":"132","author":"Jain","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB15","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.2307\/2275636","article-title":"The structure of intrinsic complexity of learning","volume":"62","author":"Jain","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF03037092","article-title":"Monotonic and non-monotonic inductive inference","volume":"8","author":"Jantke","year":"1991","journal-title":"New Gen. Comput."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB17","series-title":"Algorithmic Learning Theory: 3rd Internat. Workshop (ALT '92)","first-page":"147","article-title":"Monotonic language learning","volume":"vol. 743","author":"Kapur","year":"1992"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB18","series-title":"2nd European Conf. on Computational Learning Theory","first-page":"252","article-title":"MDL learning of unions of simple pattern languages from positive examples","volume":"vol. 904","author":"Kilpel\u00e4inen","year":"1995"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB19","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","article-title":"Notations for ordinal numbers","volume":"3","author":"Kleene","year":"1938","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB20","series-title":"Proc 2nd Internat. Workshop on Nonmonotonic and Inductive Logic","first-page":"254","article-title":"Monotonic versus non-monotonic language learning","volume":"vol. 659","author":"Lange","year":"1993"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(95)00284-7","article-title":"Monotonic and dual monotonic language learning","volume":"155","author":"Lange","year":"1996","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB22","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB23","series-title":"Proc. 4th Annual Workshop on Computational Learning Theory","first-page":"375","article-title":"The correct definition of finite elasticity: corrigendum to identification of unions","author":"Motoki","year":"1991"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB24","series-title":"Algorithmic learning theory: 4th Internat. Workshop on Analogical and Inductive Inference (AII '94) and 5th Internat. Workshop on Algorithmic Learning Theory (ALT '94)","first-page":"484","article-title":"Inductive inference of an approximate concept from positive data","volume":"vol. 872","author":"Mukouchi","year":"1994"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB25","series-title":"Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"Osherson","year":"1986"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB26","series-title":"Analogical and Inductive Inference, Proc. 2nd Internat. Workshop (AII '89)","first-page":"18","article-title":"Inductive inference, DFAs, and computational complexity","volume":"vol. 397","author":"Pitt","year":"1989"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB27","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB28","series-title":"Higher Recursion Theory","author":"Sacks","year":"1990"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB29","article-title":"Inductive inference of length bounded EFS's from positive data","author":"Sato","year":"1994"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB30","series-title":"Proc. 3rd Annual Workshop on Computational Learning Theory","first-page":"122","article-title":"Pattern languages are not learnable","author":"Schapire","year":"1990"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB31","article-title":"Studies on inductive inference from positive data","author":"Shinohara","year":"1986"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB32","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/inco.1994.1006","article-title":"Rich classes inferable from positive data: Length-bounded elementary formal systems","volume":"108","author":"Shinohara","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00005-5_BIB33","series-title":"Proc 2nd Annual Workshop on Computational Learning Theory","first-page":"328","article-title":"Identification of unions of languages drawn from an identifiable class","author":"Wright","year":"1989"},{"key":"10.1016\/S0304-3975(99)00005-5_BIB34","series-title":"Algorithmic Learning for Knowledge-Based Systems","first-page":"190","article-title":"A guided tour across the boundaries of learning recursive languages","volume":"vol. 961","author":"Zeugmann","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:21:10Z","timestamp":1555406470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000055"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00005-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}