{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:27Z","timestamp":1720201107602},"reference-count":15,"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)90129-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"1-14","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Complete classes of automata for the \u03b10-product"],"prefix":"10.1016","volume":"47","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"P\u00e1l","family":"D\u00f6m\u00f6si","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90129-5_BIB1","series-title":"Algebraic Theory of Machines, Languages and Semigroups","year":"1968"},{"key":"10.1016\/0304-3975(86)90129-5_BIB2","first-page":"37","article-title":"On minimal R-complete systems of finite automata","volume":"3","author":"D\u00f6m\u00f6si","year":"1976","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90129-5_BIB3","series-title":"Proc. Conf. on Automata, Languages and Mathematical Systems","first-page":"37","article-title":"On cascade products of standard automata","author":"D\u00f6m\u00f6si","year":"1984"},{"key":"10.1016\/0304-3975(86)90129-5_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)90129-5_BIB5","article-title":"Complete classes of automata for the \u03b11-product","author":"\u00c9sik","year":"1987","journal-title":"Found. Control Engrg."},{"key":"10.1016\/0304-3975(86)90129-5_BIB6","article-title":"Loop products and loop-free products","author":"\u00c9sik","year":"1987","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90129-5_BIB7","first-page":"299","article-title":"On products of automata with identity","volume":"7","author":"\u00c9sik","year":"1986","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90129-5_BIB8","first-page":"50","article-title":"\u041a pea\u043b\u0438\u044da\u0446\u0438\u0438 a\u0432\u0442yeo\u043ca\u0442yeo\u0432 \u043aacc\u043aa\u0446\u0438\u043d\u044a\u0438\u043c coe\u0446\u0438\u043de\u043d\u0446e\u043c c\u0442yea\u043d\u0446ap\u0442ye\u043d\u0431\u0438\u0447 a\u0432\u0442yeo\u043ca\u0442yeo\u0432","volume":"2","author":"Evtu\u0161enko","year":"1979","journal-title":"A\u0432\u0442yeo\u043ca\u0442ye\u0438\u043aa \u0438 B\u044bl\u0438c\u0438\u0442yee\u22cf\u044c\u043da\u044f"},{"key":"10.1016\/0304-3975(86)90129-5_BIB9","series-title":"2nd 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)90129-5_BIB10","series-title":"Algebraic Theory of Automata","author":"G\u00e9cseg","year":"1972"},{"key":"10.1016\/0304-3975(86)90129-5_BIB11","series-title":"Algebraic Theory of Automata","author":"Ginzburg","year":"1968"},{"key":"10.1016\/0304-3975(86)90129-5_BIB12","first-page":"3","volume":"16","author":"Glu\u0161kov","year":"1961","journal-title":"A\u0431c\u0442yepa\u043a\u0442ye\u043da\u044f \u0442yeeop\u0438\u044f a\u0432\u0442yeo\u043ca\u0442yeo\u0432, \u0423c\u043fe\u0447\u0438 Ma\u0442yee\u043ca\u0442ye\u0438lec\u043a\u0438\u0447 Hay\u043a"},{"key":"10.1016\/0304-3975(86)90129-5_BIB13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(62)90193-6","article-title":"Loop-free structure of sequential machines","volume":"5","author":"Hartmanis","year":"1962","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90129-5_BIB14","first-page":"61","article-title":"On finite definite automata","volume":"7","author":"Imreh","year":"1984","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(86)90129-5_BIB15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/S0019-9958(67)90228-8","article-title":"Cascade synthesis of finite-state machines","volume":"10","author":"Zeiger","year":"1967","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:53:27Z","timestamp":1553158407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":15,"alternative-id":["0304397586901295"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90129-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}