{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:18Z","timestamp":1720201038563},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0304-3975(86)90080-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On \u03b10-products and \u03b12-products"],"prefix":"10.1016","volume":"48","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferenc","family":"G\u00e9cseg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90080-0_BIB1","series-title":"Algebraic Theory of Machines, Languages, and Semigroups","year":"1968"},{"key":"10.1016\/0304-3975(86)90080-0_BIB2","first-page":"85","article-title":"On homomorphically \u03b1i-complete systems of automata","volume":"6","author":"D\u00f6m\u00f6si","year":"1983","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90080-0_BIB3","first-page":"149","article-title":"On vi-products of automata","volume":"6","author":"D\u00f6m\u00f6si","year":"1983","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90080-0_BIB4","first-page":"135","article-title":"Homomorphically complete classes of automata with respect to the \u03b12-product","volume":"48","author":"\u00c9sik","year":"1985","journal-title":"Acta Sci. Math."},{"key":"10.1016\/0304-3975(86)90080-0_BIB5","first-page":"95","article-title":"Complete classes of automata for the \u03b11-product","volume":"11","author":"\u00c9sik","year":"1986","journal-title":"Found. Control Engrg."},{"key":"10.1016\/0304-3975(86)90080-0_BIB6","unstructured":"Z. \u00c9sik, On \u03b11\u03bb-products of automata, Acta Sci. Math., to appear."},{"key":"10.1016\/0304-3975(86)90080-0_BIB7","article-title":"Loop products and loop-free products","volume":"8","author":"\u00c9sik","year":"1987","journal-title":"Acta Cybernet."},{"issue":"1","key":"10.1016\/0304-3975(86)90080-0_BIB8","first-page":"1","article-title":"Complete classes of automata for the \u03b10-product","volume":"47","author":"\u00c9sik","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90080-0_BIB9","first-page":"49","article-title":"The \u03b12-product is homomorphically general","volume":"V","author":"\u00c9sik","year":"1983","journal-title":"Papers on Automata Theory, Budapest"},{"key":"10.1016\/0304-3975(86)90080-0_BIB10_1","first-page":"50","article-title":"On the realization of automata by cascade connection of standard automata","volume":"13","author":"Evtu\u0161enko","year":"1979","journal-title":"Avtomat. i Vy\u010disl. Tekhn. (Riga)"},{"key":"10.1016\/0304-3975(86)90080-0_BIB10_2","first-page":"42","volume":"13","author":"Evtu\u0161enko","year":"1979","journal-title":"Automat. Control Comput. Sci."},{"key":"10.1016\/0304-3975(86)90080-0_BIB11","series-title":"Proc. 2nd Internat. Coll. on Automata, Languages and Programming","first-page":"351","article-title":"Composition of automata","volume":"14","author":"G\u00e9cseg","year":"1974"},{"key":"10.1016\/0304-3975(86)90080-0_BIB12","series-title":"Products of Automata","author":"G\u00e9cseg","year":"1986"},{"key":"10.1016\/0304-3975(86)90080-0_BIB13","series-title":"Algebraic Theory of Automata","author":"Ginzburg","year":"1968"},{"key":"10.1016\/0304-3975(86)90080-0_BIB14","first-page":"3","article-title":"Abstract theory of automata","volume":"16","author":"Glu\u0161kov","year":"1961","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/0304-3975(86)90080-0_BIB15_1","first-page":"702","article-title":"Completeness conditions for finite automata","volume":"1","author":"Leti\u010devski\u01d0","year":"1961","journal-title":"\u017d. Vy\u010disl. Mat. i Mat. Fiz."},{"key":"10.1016\/0304-3975(86)90080-0_BIB15_2","first-page":"702","volume":"1","author":"Leti\u010devski\u01d0","year":"1961","journal-title":"U.S.S.R. Comput. Math. and Math. Phys."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900800?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900800?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:54:01Z","timestamp":1553187241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":17,"alternative-id":["0304397586900800"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90080-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}