{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:53:03Z","timestamp":1648903983573},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1974,9,1]],"date-time":"1974-09-01T00:00:00Z","timestamp":147225600000},"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":[[1974,9]]},"DOI":"10.1007\/bf01762671","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T19:24:29Z","timestamp":1118863469000},"page":"235-242","source":"Crossref","is-referenced-by-count":3,"title":["Group-complexity and reversals of finite semigroups"],"prefix":"10.1007","volume":"8","author":[{"given":"Yechezkel","family":"Zalcstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762671_CR1","first-page":"127","volume-title":"Algebraic Theory of Machines, Language and Semigroups","author":"M. A. Arbib","year":"1968","unstructured":"M. A. Arbib, J. Rhodes andB. Tilson, Complexity and group-complexity of finite-state machines and finite semigroups, inAlgebraic Theory of Machines, Language and Semigroups (M. A. Arbib, editor), Academic Press, New York, 1968, pp. 127\u2013145."},{"key":"BF01762671_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J. Brzozowski","year":"1973","unstructured":"J. Brzozowski andI. Simon, Characterization of locally testable events,Discrete Math. 4 (1973), 243\u2013271.","journal-title":"Discrete Math."},{"key":"BF01762671_CR3","series-title":"Math. Surveys","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/007.1","volume-title":"The Algebraic Theory of Semigroups, Vol. I","author":"A. H. Clifford","year":"1961","unstructured":"A. H. Clifford andG. B. Preston,The Algebraic Theory of Semigroups, Vol. I, Math. Surveys No. 7, Amer. Math. Soc., Providence, R.I., 1961."},{"key":"BF01762671_CR4","volume-title":"Abelian Categories: An Introduction to the Theory of Functors","author":"P. Freyd","year":"1964","unstructured":"P. Freyd,Abelian Categories: An Introduction to the Theory of Functors, Harper and Row, New York, 1964."},{"key":"BF01762671_CR5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/1970558","volume":"88","author":"K. Krohn","year":"1968","unstructured":"K. Krohn andJ. Rhodes, Complexity of finite semigroups,Annals of Math. 88 (1968), 128\u2013160.","journal-title":"Annals of Math."},{"key":"BF01762671_CR6","first-page":"7","volume-title":"Algebraic Theory of Machines, Languages and Semigroups","author":"K. Krohn","year":"1968","unstructured":"K. Krohn, J. Rhodes andB. Tilson, Lectures on finite semigroups, Chapters 5, 7\u20139 inAlgebraic Theory of Machines, Languages and Semigroups (M. A. Arbib, editor), Academic Press, New York, 1968."},{"key":"BF01762671_CR7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"R. McNaughton, Algebraic decision procedures for local testability,Math. Systems Theory 8 (1974), 60\u201376.","journal-title":"Math. Systems Theory"},{"key":"BF01762671_CR8","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton andS. Papert,Counter-Free Automata, M.I.T. Press, Cambridge, Mass., 1971."},{"key":"BF01762671_CR9","doi-asserted-by":"crossref","unstructured":"J. Rhodes, A proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups,J. Comb. Theory (to appear).","DOI":"10.1016\/0097-3165(74)90045-4"},{"key":"BF01762671_CR10","unstructured":"I. Simon,Hierarchies of Events with Dot-Depth One, Ph.D. Thesis, University of Waterloo, 1972."},{"key":"BF01762671_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02572961","volume":"3","author":"B. Tilson","year":"1971","unstructured":"B. Tilson, Decomposition and complexity of finite semigroups,Semigroup Forum 3 (1971), 189\u2013250.","journal-title":"Semigroup Forum"},{"key":"BF01762671_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y. Zalcstein","year":"1972","unstructured":"Y. Zalcstein, Locally testable Languages,J. Computer System Sciences 6 (1972), 151\u2013167.","journal-title":"J. Computer System Sciences"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762671\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:41:50Z","timestamp":1557333710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,9]]}},"alternative-id":["BF01762671"],"URL":"https:\/\/doi.org\/10.1007\/bf01762671","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,9]]}}}