{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:13:56Z","timestamp":1768281236108,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0020-0190(79)90090-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"38-40","source":"Crossref","is-referenced-by-count":2,"title":["Generalized1.5 sequential machine maps"],"prefix":"10.1016","volume":"8","author":[{"given":"A.","family":"Buda","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(79)90090-5_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/197610R100051","article-title":"Transductions de for\u00eats reconnaisables monadiques, for\u00eats cor\u00e9guli\u00e8res, R.A.I.R.O.","volume":"10","author":"Arnold","year":"1976","journal-title":"Informatique th\u00e9orique"},{"key":"10.1016\/0020-0190(79)90090-5_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/S0022-0000(73)80045-5","article-title":"The equivalence problem for deterministic two-tape automata","volume":"7","author":"Bird","year":"1973","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0020-0190(79)90090-5_BIB3","volume":"108","author":"Buda","year":"1978"},{"key":"10.1016\/0020-0190(79)90090-5_BIB4","article-title":"Theory of program schemata","volume":"71","author":"Ershov","year":"1971","journal-title":"Proc. IFIP Congress"},{"key":"10.1016\/0020-0190(79)90090-5_BIB5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1090\/S0002-9947-60-99988-8","article-title":"Some remarks on abstract machines","volume":"96","author":"Ginsburg","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(79)90090-5_BIB6","article-title":"The functional equivalence of discrete transducers","volume":"2","author":"Letichevsky","year":"1969","journal-title":"Cybernetica Journal"},{"key":"10.1016\/0020-0190(79)90090-5_BIB7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comp. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900905?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900905?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:10Z","timestamp":1555072090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0020019079900905"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90090-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}