{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:47Z","timestamp":1760245007926},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6780,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0004-3702(94)00023-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:49:34Z","timestamp":1027590574000},"page":"139-171","source":"Crossref","is-referenced-by-count":12,"title":["Learning dynamics: system identification for perceptually challenged agents"],"prefix":"10.1016","volume":"72","author":[{"given":"Kenneth","family":"Basye","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Dean","sequence":"additional","affiliation":[]},{"given":"Leslie Pack","family":"Kaelbling","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)00023-T_bib1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inf. Control"},{"key":"10.1016\/0004-3702(94)00023-T_bib2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counterexamples","volume":"75","author":"Angluin","year":"1987","journal-title":"Inf. Comput."},{"key":"10.1016\/0004-3702(94)00023-T_bib3","article-title":"Connectionist modeling and control of finite state environments","author":"Bachrach","year":"1992"},{"key":"10.1016\/0004-3702(94)00023-T_bib4","series-title":"Proceedings IJCAI-89","article-title":"Coping with uncertainty in map learning","author":"Basye","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib5","article-title":"Coping with uncertainty in map learning","author":"Basye","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib6","article-title":"A framework for map construction","author":"Basye","year":"1992"},{"key":"10.1016\/0004-3702(94)00023-T_bib7","series-title":"Proceedings AAAI-92","article-title":"Inferring finite automata with stochastic output functions and an application to map learning","author":"Dean","year":"1992"},{"key":"10.1016\/0004-3702(94)00023-T_bib8","article-title":"Inferring finite automata with stochastic output functions and an application to map learning","author":"Dean","year":"1992"},{"key":"10.1016\/0004-3702(94)00023-T_bib9","series-title":"Proceedings AAAI-90","article-title":"Coping with uncertainty in a control system for navigation and exploration","author":"Dean","year":"1990"},{"key":"10.1016\/0004-3702(94)00023-T_bib10","author":"Feller","year":"1970"},{"key":"10.1016\/0004-3702(94)00023-T_bib11","first-page":"132","article-title":"State-identification experiments in finite automata","volume":"4","author":"Gill","year":"1961","journal-title":"Inf. Comput."},{"key":"10.1016\/0004-3702(94)00023-T_bib12","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/0005-1098(72)90033-7","article-title":"System identification via state characterization","volume":"8","author":"Gold","year":"1972","journal-title":"Automatica"},{"key":"10.1016\/0004-3702(94)00023-T_bib13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given sets","volume":"37","author":"Gold","year":"1978","journal-title":"Inf. Control"},{"key":"10.1016\/0004-3702(94)00023-T_bib14","series-title":"Proceedings Seventh Yale Workshop on Adaptive and Learning Systems","article-title":"Learning labelled graphs from noisy data","author":"Kaelbling","year":"1992"},{"key":"10.1016\/0004-3702(94)00023-T_bib15","series-title":"Proceedings 31st ACM Symposium on Foundations of Computer Science","article-title":"Conductance and convergence of Markov chains: a combinatorial treatment of expanders","author":"Mihail","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib16","series-title":"Automata Studies","first-page":"129","article-title":"Gedanken-experiments on sequential machines","author":"Moore","year":"1956"},{"key":"10.1016\/0004-3702(94)00023-T_bib17","series-title":"Proceedings 21st Annual ACM Symposium on Theoretical Computing","article-title":"The minimum consistent DFA problem cannot be approximated within any polynomial","author":"Pitt","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib18","series-title":"Proceedings 29th ACM Symposium on Foundations of Computer Science","article-title":"Diversity-based inference of finite automata","author":"Rivest","year":"1987"},{"key":"10.1016\/0004-3702(94)00023-T_bib19","series-title":"Proceedings 21st Annual ACM Symposium on Theoretical Computing","article-title":"Inference of finite automata using homing sequences","author":"Rivest","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib20","article-title":"The design and analysis of efficient learning algorithms","author":"Schapire","year":"1991"},{"key":"10.1016\/0004-3702(94)00023-T_bib21","article-title":"Learning sequential structure in simple recurrent networks","volume":"Vol. 1","author":"Servan-Schreiber","year":"1989"},{"key":"10.1016\/0004-3702(94)00023-T_bib22","series-title":"Proceedings Seventh International Conference on Machine Learning","article-title":"Integrated architectures for learning, planning, and reacting based on approximating dynamic programming","author":"Sutton","year":"1990"},{"key":"10.1016\/0004-3702(94)00023-T_bib23","series-title":"Proceedings 23rd ACM Symposium on Theoretical Computing","article-title":"Testing finite state machines","author":"Yannakakis","year":"1991"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029400023T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029400023T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T22:20:05Z","timestamp":1556490005000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029400023T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["000437029400023T"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)00023-t","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}