{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:31Z","timestamp":1759626631808,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0304-3975(99)00274-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"27-54","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["On complete systems of automata"],"prefix":"10.1016","volume":"245","author":[{"given":"P\u00e1l","family":"D\u00f6m\u00f6si","sequence":"first","affiliation":[]},{"given":"Chrystopher L.","family":"Nehaniv","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(99)00274-1_BIB1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0022-4049(94)00063-O","article-title":"Subsemigroups and Complexity via the Presentation Lemma","volume":"101","author":"Austin","year":"1995","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(99)00274-1_BIB2","first-page":"433","article-title":"Planar permutation graphs","volume":"B 3","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. H. Poincar\u00e9, Sec."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S1385-7258(54)50043-0","article-title":"A theorem of Kuratowski","volume":"A 57","author":"Dirac","year":"1954","journal-title":"Nederl. Akad. Wetensch. Proc. Ser."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB4","first-page":"315","article-title":"On the hierarchy of \u03bdi-products of automata","volume":"8","author":"D\u00f6m\u00f6si","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB5","first-page":"149","article-title":"On \u03bdi-products of automata","volume":"6","author":"D\u00f6m\u00f6si","year":"1983","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB6","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\/S0304-3975(99)00274-1_BIB7","unstructured":"Z. \u00c9sik, Gy. Horv\u00e1th, The \u03b12-product is homomorphically general, Papers on Automata Theory V, No. DM83-3, 49\u201362, Department of Mathematics, Karl Marx University of Economics, Budapest, 1983."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB8","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg, Composition of automata, Automata, Languages and Programming: 2nd Colloquium, Saarbr\u00fccken in: Lecture Notes in Computer Science, Vol. 14, Springer, Berlin, 1974, pp. 351\u2013363.","DOI":"10.1007\/978-3-662-21545-6_27"},{"key":"10.1016\/S0304-3975(99)00274-1_BIB9","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg, Products of Automata, EATCS Monographs on Theoretical Computer Science, vol. 7, Springer, Berlin, 1986.","DOI":"10.1007\/978-3-642-61611-2"},{"key":"10.1016\/S0304-3975(99)00274-1_BIB10","first-page":"3","article-title":"A comparison of \u03b1i-products and \u03bdi-products","volume":"12","author":"G\u00e9cseg","year":"1987","journal-title":"Found. Control Eng."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90204-F","article-title":"On \u03b10 \u2013 \u03bd1-products of automata","volume":"80","author":"G\u00e9cseg","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB12","unstructured":"F. G\u00e9cseg, I. Pe\u00e1k, Algebraic Theory of Automata, Disquisitiones Mathematicae Hungaricae, vol. 2 Akad\u00e9miai Kiad\u00f3, Budapest, 1972."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB13","unstructured":"V. M. Glu\u0161kov, Abstract theory of automata, Uspekhi matem. nauk 16 (5)(101) (1961) 3\u201362. Correction: Uspekhi matem. nauk 17 (2)(104) (1962) 270."},{"year":"1969","series-title":"Graph Theory Addison-Wesley Series in Mathematics","author":"Harary","key":"10.1016\/S0304-3975(99)00274-1_BIB14"},{"key":"10.1016\/S0304-3975(99)00274-1_BIB15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1090\/S0002-9947-1965-0188316-1","article-title":"Algebraic theory of machines, I. Prime decomposition theorem for finite semi-groups and machines","volume":"116","author":"Krohn","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB16","unstructured":"K.B. Krohn, J.L. Rhodes, B.R. Tilson, The prime decomposition theorem of the algebraic theory of machines, M. Arbib (Ed.), Algebraic Theory of Machines, Languages and Semigroups Academic Press, New York, 1968."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probl\u00e8me des courbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(99)00274-1_BIB18","first-page":"702","article-title":"Conditions of completeness for finite automata","volume":"1","author":"Letichevsky","year":"1961","journal-title":"\u017durn. V\u010disl. Matem. i Matem. Fiz."},{"issue":"1","key":"10.1016\/S0304-3975(99)00274-1_BIB19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0022-4049(95)00030-5","article-title":"From relation to emulation","volume":"107","author":"Nehaniv","year":"1996","journal-title":"J. Pure Appl. Algebra"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:59Z","timestamp":1759625519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0304397599002741"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00274-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On complete systems of automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00274-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}