{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:39:21Z","timestamp":1649014761378},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,5,1]],"date-time":"1975-05-01T00:00:00Z","timestamp":168134400000},"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":13958,"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,5]]},"DOI":"10.1016\/s0019-9958(75)90232-6","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"54-64","source":"Crossref","is-referenced-by-count":1,"title":["Some memory characteristics of incompletely specified sequential machines"],"prefix":"10.1016","volume":"28","author":[{"given":"Arun Narayan","family":"Toke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Vairavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(75)90232-6_bib1","first-page":"356","article-title":"Feedback in synchronous sequential circuits","volume":"EC-15","author":"Friedman","year":"1966","journal-title":"IEEE Trans. Elect. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib2","first-page":"156","article-title":"Introduction to the Theory of Finite State Machines","author":"Gill","year":"1962"},{"key":"10.1016\/S0019-9958(75)90232-6_bib3","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/PGEC.1965.264154","article-title":"On the bound to the memory of a sequential machine","volume":"EC-14","author":"Gill","year":"1965","journal-title":"IEEE Trans. Elect. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib4","first-page":"337","article-title":"Introduction to Switching and Automata Theory","author":"Harrison","year":"1965"},{"key":"10.1016\/S0019-9958(75)90232-6_bib5","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/T-C.1970.222905","article-title":"On finite memory sequential machines","volume":"C-19","author":"Kambayashi","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib6","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/PGEC.1966.264389","article-title":"A note on finite memory sequential machines","volume":"EC-15","author":"Massey","year":"1966","journal-title":"IEEE Trans. Elect. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib7","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/PGEC.1967.264676","article-title":"Note on binary-input binary-output finite memory sequential machines","volume":"E-16","author":"Newborn","year":"1967","journal-title":"IEEE Trans. Elect. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TC.1968.5008872","article-title":"Maximal memory binary-input binary-output finite memory sequential machines","volume":"C-17","author":"Newborn","year":"1968","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib9","article-title":"On maximum-memory automata","author":"Ohbayashi","year":"1968","journal-title":"IECEJ, Rec. Prof. Group on Automata Theory"},{"key":"10.1016\/S0019-9958(75)90232-6_bib10","article-title":"On the Output-Memory of Finite State Machines","author":"Toke","year":"1973"},{"key":"10.1016\/S0019-9958(75)90232-6_bib11","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/T-C.1969.222782","article-title":"On the lower bound to the memory of finite state machines","volume":"C-18","author":"Vairavan","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/S0019-9958(71)80003-7","article-title":"An exclusion principle for finite memory sequential machines","volume":"19","author":"Vairavan","year":"1971","journal-title":"Inform. Cont."},{"key":"10.1016\/S0019-9958(75)90232-6_bib13","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1109\/TC.1972.5009017","article-title":"Minimal input-memory and output-memory finite state Machines","volume":"C-21","author":"Vairavan","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0019-9958(75)90232-6_bib14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0019-9958(70)80041-9","article-title":"Input-output relations of finite memory systems","volume":"16","author":"Vairavan","year":"1970","journal-title":"Inform. Contr."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875902326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875902326?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:03Z","timestamp":1548944643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995875902326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,5]]}},"alternative-id":["S0019995875902326"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(75)90232-6","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1975,5]]}}}