{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:21:07Z","timestamp":1648628467594},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1975,2,1]],"date-time":"1975-02-01T00:00:00Z","timestamp":160444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":14047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1975,2]]},"DOI":"10.1016\/s0019-9958(75)90127-8","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"178-195","source":"Crossref","is-referenced-by-count":3,"title":["A convenient cryptomorphic version of recursive function theory"],"prefix":"10.1016","volume":"27","author":[{"given":"Ronald E.","family":"Prather","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(75)90127-8_bib1","series-title":"On the Foundations of Combinatorial Geometry","author":"Crapo","year":"1970"},{"key":"10.1016\/S0019-9958(75)90127-8_bib2","series-title":"Recursiveness","author":"Eilenberg","year":"1970"},{"key":"10.1016\/S0019-9958(75)90127-8_bib3","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(75)90127-8_bib4","series-title":"Theory of Categories","author":"Mitchell","year":"1965"},{"key":"10.1016\/S0019-9958(75)90127-8_bib5","series-title":"Recursive Functions","author":"Peter","year":"1967"},{"key":"10.1016\/S0019-9958(75)90127-8_bib6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01695771","article-title":"On categories of infinite automata","volume":"4","author":"Prather","year":"1970","journal-title":"Math. Sys Theory"},{"key":"10.1016\/S0019-9958(75)90127-8_bib7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(72)90552-9","article-title":"Epimorphisms in certain categories of transducers","volume":"21","author":"Prather","year":"1972","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90127-8_bib8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(71)80005-0","article-title":"A categorical characterization of general automata","volume":"19","author":"Rine","year":"1971","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90127-8_bib9","series-title":"Recursive Function Theory and Logic","author":"Yasuhara","year":"1971"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875901278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875901278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:24:19Z","timestamp":1548944659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995875901278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,2]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,2]]}},"alternative-id":["S0019995875901278"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(75)90127-8","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1975,2]]}}}