{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:06:19Z","timestamp":1648886779433},"reference-count":9,"publisher":"Elsevier","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/b978-0-08-050684-5.50012-4","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T20:16:28Z","timestamp":1404159388000},"page":"128-147","source":"Crossref","is-referenced-by-count":4,"title":["Quasimorphisms or Queasymorphisms? Modeling Finite Automaton Environments"],"prefix":"10.1016","author":[{"given":"T.H.","family":"Westerdale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-08-050684-5.50012-4_bib1","series-title":"Applications of the Theory of Matrices","author":"Gantmacher","year":"1959"},{"issue":"2\/3","key":"10.1016\/B978-0-08-050684-5.50012-4_bib2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1022614421909","article-title":"Credit assignment in rule discovery systems based on genetic algorithms","volume":"3","author":"Grefenstette","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/B978-0-08-050684-5.50012-4_bib3","unstructured":"Holland, J. H. (1969). Adaptive plans optimal for payoff-only environments."},{"key":"10.1016\/B978-0-08-050684-5.50012-4_bib4","series-title":"Induction: Processes of Inference, Learning and Discovery","author":"Holland","year":"1986"},{"key":"10.1016\/B978-0-08-050684-5.50012-4_bib5","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"issue":"3","key":"10.1016\/B978-0-08-050684-5.50012-4_bib6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0890-5401(88)90047-8","article-title":"An automaton decomposition for learning system environments","volume":"77","author":"Westerdale","year":"1988","journal-title":"Information and Computation"},{"issue":"3","key":"10.1016\/B978-0-08-050684-5.50012-4_bib7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TSMC.1986.4308969","article-title":"A reward scheme for production systems with overlapping conflict sets","volume":"SMC-16","author":"Westerdale","year":"1986","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"10.1016\/B978-0-08-050684-5.50012-4_bib8","series-title":"Theory of Modeling and Simulation","author":"Zeigler","year":"1976"},{"issue":"4","key":"10.1016\/B978-0-08-050684-5.50012-4_bib9","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1145\/321724.321737","article-title":"Towards a formal theory of modeling and simulation: Structure preserving morphisms","volume":"19","author":"Zeigler","year":"1972","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080506845500124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080506845500124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T05:25:27Z","timestamp":1538457927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780080506845500124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1016\/b978-0-08-050684-5.50012-4","relation":{},"ISSN":["1081-6593"],"issn-type":[{"value":"1081-6593","type":"print"}],"subject":[],"published":{"date-parts":[[1991]]}}}