{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:32Z","timestamp":1759638032512},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1970,12,1]],"date-time":"1970-12-01T00:00:00Z","timestamp":28857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1970,12]]},"DOI":"10.1007\/bf01704080","type":"journal-article","created":{"date-parts":[[2005,6,11]],"date-time":"2005-06-11T21:28:44Z","timestamp":1118525324000},"page":"373-384","source":"Crossref","is-referenced-by-count":7,"title":["On the endomorphisms of finite automata"],"prefix":"10.1007","volume":"4","author":[{"given":"Jerzy W.","family":"Grzymala-Busse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01704080_CR1","volume-title":"Automorphism groups and quotients of strongly connected automata and monadic algebras. Report 204","author":"R. Bayer","year":"1966","unstructured":"R. Bayer, Automorphism groups and quotients of strongly connected automata and monadic algebras. Report 204, Department of Computer Sciences, University of Illinois, Urbana, May 1966."},{"key":"BF01704080_CR2","doi-asserted-by":"crossref","unstructured":"R. Bayer, On the endomorphisms and congruences of automata. Mathematical Note 497, Math Res. Lab., Boeing Scientific Research Laboratories, Jan. 1967.","DOI":"10.1109\/FOCS.1967.22"},{"key":"BF01704080_CR3","volume-title":"Number Theory","author":"A. A. Buh\u0161tab","year":"1966","unstructured":"A. A. Buh\u0161tab,Number Theory (Russian), Izd. \u201cProsve\u0161\u010denie\u201d, Moscow, 1966."},{"key":"BF01704080_CR4","first-page":"353","volume":"2","author":"P. Deussen","year":"1967","unstructured":"P. Deussen, Some results on the set of congruence relations in a finite, strongly connected automaton,Computing (Arch. Elecktron. Rechnen)2 (1967), 353\u2013367.","journal-title":"Computing (Arch. Elecktron. Rechnen)"},{"key":"BF01704080_CR5","first-page":"327","volume":"1","author":"G. Feichtinger","year":"1966","unstructured":"G. Feichtinger, Some results on the relations between automata and their automorphism groups,Computing (Arch. Elektron. Rechnen)1 (1966), 327\u2013340.","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"BF01704080_CR6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321138.321144","volume":"9","author":"A. C. Fleck","year":"1962","unstructured":"A. C. Fleck, Isomorphism groups of automata,J. Assoc. Comput. Mach. 9 (1962), 469\u2013476.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704080_CR7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/PGEC.1964.263908","volume":"EC-13","author":"A. Gill","year":"1964","unstructured":"A. Gill, Analysis of linear sequential circuits by confluence sets,IEEE Trans. Electronic Computers EC-13 (1964), 226\u2013231.","journal-title":"IEEE Trans. Electronic Computers"},{"key":"BF01704080_CR8","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/0016-0032(63)90496-4","volume":"276","author":"A. Gill","year":"1963","unstructured":"A. Gill, Time-varying sequential machines,J. Franklin Inst. 276 (1963), 519\u2013539.","journal-title":"J. Franklin Inst."},{"key":"BF01704080_CR9","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/321420.321425","volume":"14","author":"A. Gill","year":"1967","unstructured":"A. Gill andJ. R. Flexer, Periodic decomposition of sequential machines,J. Assoc. Comput. Mach. 14 (1967), 666\u2013676.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704080_CR10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/321510.321512","volume":"16","author":"J. W. Grzymala-Busse","year":"1969","unstructured":"J. W. Grzymala-Busse, Automorphisms of polyadic automata,J. Assoc. Comput. Mach. 16 (1969), 208\u2013219.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704080_CR11","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1145\/321526.321532","volume":"16","author":"J. W. Grzymala-Busse","year":"1969","unstructured":"J. W. Grzymala-Busse, On the periodic representations and the reducibility of periodic automata,J. Assoc. Comput. Mach. 16 (1969), 432\u2013441.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704080_CR12","unstructured":"J. W. Grzymala-Busse, Periodic representations andT-partitionable equivalents of sequential machines. (Submitted for publication.)"},{"key":"BF01704080_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TEC.1961.5219184","volume":"10","author":"J. Hartmanis","year":"1961","unstructured":"J. Hartmanis, On the state assignment problem for sequential machines I,IRE Trans. Electronic Computers 10 (1961), 157\u2013165.","journal-title":"IRE Trans. Electronic Computers"},{"key":"BF01704080_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/TEC.1962.5219325","volume":"11","author":"J. Hartmanis","year":"1962","unstructured":"J. Hartmanis, Maximal autonomous clocks of sequential machines,IRE Trans. Electronic Computers 11 (1962), 83\u201386.","journal-title":"IRE Trans. Electronic Computers"},{"key":"BF01704080_CR15","volume-title":"Algebraic Structure Theory of Sequential Machines","author":"J. Hartmanis","year":"1966","unstructured":"J. Hartmanis andR. E. Stearns,Algebraic Structure Theory of Sequential Machines, Prentice-Hall, Englewood Cliffs, N.J., 1966."},{"key":"BF01704080_CR16","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1090\/S0002-9947-1940-0002894-7","volume":"48","author":"E. L. Post","year":"1940","unstructured":"E. L. Post, Polyadic groups,Trans. Amer. Math. Soc. 48 (1940), 208\u2013350.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01704080_CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/321127.321131","volume":"9","author":"G. P. Weeg","year":"1962","unstructured":"G. P. Weeg, The structure of an automaton and its operation-preserving transformation group,J. Assoc. Comput. Mach. 9 (1962), 345\u2013349.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704080_CR18","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/PGEC.1965.264156","volume":"EC-14","author":"S. S. Yau","year":"1965","unstructured":"S. S. Yau, Autonomous clocks in sequential machines,IEEE Trans. Electronic Computers EC-14 (1965), 467\u2013472.","journal-title":"IEEE Trans. Electronic Computers"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01704080\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T17:07:32Z","timestamp":1586279252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01704080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1970,12]]}},"alternative-id":["BF01704080"],"URL":"https:\/\/doi.org\/10.1007\/bf01704080","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1970,12]]}}}