{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:44Z","timestamp":1767237104704},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_5","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"67-80","source":"Crossref","is-referenced-by-count":14,"title":["Matrix Mortality and the \u010cern\u00fd-Pin Conjecture"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Steinberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Series in Algebra","volume-title":"Finite semigroups and universal algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite semigroups and universal algebra. Series in Algebra, vol.\u00a03. World Scientific Publishing Co. Inc, River Edge (1994); Translated from the 1992 Portuguese original and revised by the author"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1090\/S0002-9947-08-04712-0","volume":"361","author":"J. Almeida","year":"2009","unstructured":"Almeida, J., Margolis, S., Steinberg, B., Volkov, M.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc.\u00a0361(3), 1429\u20131461 (2009)","journal-title":"Trans. Amer. Math. Soc."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/9789812702616_0002","volume-title":"Semigroups and languages","author":"D.S. Ananichev","year":"2004","unstructured":"Ananichev, D.S., Volkov, M.V.: Some results on \u010cern\u00fd type problems for transformation semigroups. In: Semigroups and languages, pp. 23\u201342. World Sci. Publ., River Edge (2004)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"D.S. Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci.\u00a0330(1), 3\u201313 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theoret. Comput. Sci.\u00a0376(1-2), 30\u201341 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2006.02.003","volume":"359","author":"F. Arnold","year":"2006","unstructured":"Arnold, F., Steinberg, B.: Synchronizing groups and automata. Theoret. Comput. Sci.\u00a0359(1-3), 101\u2013110 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR7","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational series and their languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a012. Springer, Berlin (1988)"},{"key":"5_CR8","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: A remark on homogeneous experiments with finite automata. Mat.-Fyz. \u010casopis Sloven. Akad. Vied\u00a014, 208\u2013216 (1964)","journal-title":"Mat.-Fyz. \u010casopis Sloven. Akad. Vied"},{"key":"5_CR9","series-title":"Mathematical Surveys","volume-title":"The algebraic theory of semigroups","author":"A.H. Clifford","year":"1961","unstructured":"Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups. Mathematical Surveys, vol.\u00a0I(7). American Mathematical Society, Providence (1961)"},{"key":"5_CR10","volume-title":"Representation theory of finite groups and associative algebras","author":"C.W. Curtis","year":"1988","unstructured":"Curtis, C.W., Reiner, I.: Representation theory of finite groups and associative algebras. Wiley Classics Library. John Wiley & Sons Inc, New York (1988); Reprint of the 1962 original, A Wiley-Interscience Publication"},{"key":"5_CR11","volume-title":"Part A: Ordinary representation theory","author":"L. Dornhoff","year":"1971","unstructured":"Dornhoff, L.: Group representation theory. In: Part A: Ordinary representation theory, Marcel Dekker Inc., New York (1971); Pure and Applied Mathematics, 7"},{"issue":"1-3","key":"5_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L. Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Inform. Th\u00e9or. Appl.\u00a032(1-3), 21\u201334 (1998)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"5_CR13","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0B. Academic Press, New York (1976); With two chapters \u201cDepth decomposition theorem\u201d and \u201cComplexity of semigroups and morphisms by Bret Tilson\u201d, Pure and Applied Mathematics, vol. 59"},{"key":"#cr-split#-5_CR14.1","doi-asserted-by":"crossref","unstructured":"Freedman, A., Gupta, R.N., Guralnick, R.M.: Shirshov???s theorem and representations of semigroups. Pacific J. Math (Special Issue), 159???176 (1997);","DOI":"10.2140\/pjm.1997.181.159"},{"key":"#cr-split#-5_CR14.2","unstructured":"Olga Taussky-Todd: in memoriam"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ganyushkin, O., Mazorchuk, V., Steinberg, B.: On the irreducible representations of a finite semigroup. Proc. Amer. Math. Soc. (to appear)","DOI":"10.1090\/S0002-9939-09-09857-8"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01703263","volume":"2","author":"R.L. Graham","year":"1968","unstructured":"Graham, R.L.: On finite 0-simple semigroups and graph theory. Math. Systems Theory\u00a02, 325\u2013339 (1968)","journal-title":"Math. Systems Theory"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(77)90006-8","volume":"5","author":"G. Jacob","year":"1977","unstructured":"Jacob, G.: Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices. Theoret. Comput. Sci.\u00a05(2), 183\u2013204 (1977\/1978)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR18","first-page":"146","volume":"73","author":"J. Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS\u00a0(73), 146 (2001)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"issue":"1-3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci.\u00a0295(1-3), 223\u2013232 (2003) Mathematical foundations of computer science (Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, 2001)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR20","first-page":"16","volume":"2","author":"A.A. Klyachko","year":"1987","unstructured":"Klyachko, A.A., Rystsov, I.C., Spivak, M.A.: On an extremal combinatorial problem connected with an estimate for the length of a reflexive word in an automaton. Kibernetika (Kiev)\u00a0(2), 16\u201320, 25, 132 (1987)","journal-title":"Kibernetika (Kiev)"},{"key":"5_CR21","unstructured":"Krohn, K., Rhodes, J., Tilson, B.: Algebraic theory of machines, languages, and semigroups. Edited by Michael A. Arbib. With a major contribution by Kenneth Krohn and John L. Rhodes, vol.\u00a01, pp. 5\u20139. Academic Press, New York (1968)"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(77)90001-9","volume":"5","author":"A. Mandel","year":"1977","unstructured":"Mandel, A., Simon, I.: On finite semigroups of matrices. Theoret. Comput. Sci.\u00a05(2), 101\u2013111 (1977\/1988)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Margolis, S.W., Steinberg, B.: The quiver of an algebra associated to the mantaci-reutenauer descent algebra and the homology of regular semigroups. Algebr. Represent. Theory (to appear)","DOI":"10.1007\/s10468-009-9181-2"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0021-8693(72)90111-1","volume":"22","author":"D.B. McAlister","year":"1972","unstructured":"McAlister, D.B.: Characters of finite semigroups. J. Algebra\u00a022, 183\u2013200 (1972)","journal-title":"J. Algebra"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/0021-8693(75)90184-2","volume":"34","author":"R. McNaughton","year":"1975","unstructured":"McNaughton, R., Zalcstein, Y.: The Burnside problem for semigroups. J. Algebra\u00a034, 292\u2013299 (1975)","journal-title":"J. Algebra"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/sapm1970491105","volume":"49","author":"M.S. Paterson","year":"1970","unstructured":"Paterson, M.S.: Unsolvability in 3\u00d73 matrices. Studies in Appl. Math.\u00a049, 105\u2013107 (1970)","journal-title":"Studies in Appl. Math."},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-08860-1_25","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1978","unstructured":"Pin, J.-E.: Sur un cas particulier de la conjecture de Cerny. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 345\u2013352. Springer, Heidelberg (1978)"},{"key":"5_CR28","series-title":"Quad. Ricerca Sci.","first-page":"37","volume-title":"Noncommutative structures in algebra and geometric combinatorics (Naples, 1978)","author":"J.-E. Pin","year":"1981","unstructured":"Pin, J.-E.: Le probl\u00e8me de la synchronisation et la conjecture de \u010cern\u00fd. In: Noncommutative structures in algebra and geometric combinatorics (Naples, 1978). Quad. Ricerca Sci., vol.\u00a0109, pp. 37\u201348. CNR, Rome (1981)"},{"key":"5_CR29","series-title":"North-Holland Math. Stud.","volume-title":"Combinatorial mathematics (Marseille-Luminy, 1981)","author":"J.-E. Pin","year":"1983","unstructured":"Pin, J.-E.: On two combinatorial problems arising from automata theory. In: Combinatorial mathematics (Marseille-Luminy, 1981). North-Holland Math. Stud., vol.\u00a075, North-Holland, Amsterdam (1983)"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jabr.1997.7395","volume":"205","author":"M.S. Putcha","year":"1998","unstructured":"Putcha, M.S.: Complex representations of finite monoids. II. Highest weight categories and quivers. J. Algebra\u00a0205(1), 53\u201376 (1998)","journal-title":"J. Algebra"},{"key":"5_CR31","series-title":"Encyclopaedia of Mathematical Sciences","volume-title":"Linear algebraic monoids","author":"L.E. Renner","year":"2005","unstructured":"Renner, L.E.: Linear algebraic monoids. Encyclopaedia of Mathematical Sciences, vol.\u00a0134. Springer, Berlin (2005); Invariant Theory and Algebraic Transformation Groups, V"},{"key":"5_CR32","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/b104443","volume-title":"The q-theory of finite semigroups","author":"J. Rhodes","year":"2009","unstructured":"Rhodes, J., Steinberg, B.: The q-theory of finite semigroups. Springer Monographs in Mathematics. Springer, New York (2009)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1142\/1018","volume-title":"Monoids and semigroups with applications (Berkeley, CA, 1989)","author":"J. Rhodes","year":"1991","unstructured":"Rhodes, J., Zalcstein, Y.: Elementary representation and character theory of finite semigroups and its application. In: Monoids and semigroups with applications (Berkeley, CA, 1989), pp. 334\u2013367. World Sci. Publ., River Edge (1991)"},{"issue":"1-2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I. Rystsov","year":"1997","unstructured":"Rystsov, I.: Reset words for commutative and solvable automata. Theoret. Comput. Sci.\u00a0172(1-2), 273\u2013279 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"5_CR35","first-page":"3","volume":"187","author":"I.C. Rystsov","year":"1992","unstructured":"Rystsov, I.C.: On the rank of a finite automaton. Kibernet. Sistem. Anal.\u00a0187(3), 3\u201310 (1992)","journal-title":"Kibernet. Sistem. Anal."},{"issue":"2","key":"5_CR36","first-page":"145","volume":"12","author":"I.K. Rystsov","year":"1995","unstructured":"Rystsov, I.K.: Quasioptimal bound for the length of reset words for regular automata. Acta Cybernet.\u00a012(2), 145\u2013152 (1995)","journal-title":"Acta Cybernet."},{"issue":"3","key":"5_CR37","first-page":"32","volume":"187","author":"I.K. Rystsov","year":"2000","unstructured":"Rystsov, I.K.: On the length of reset words for automata with simple idempotents. Kibernet. Sistem. Anal.\u00a0187(3), 32\u201339 (2000)","journal-title":"Kibernet. Sistem. Anal."},{"issue":"1","key":"5_CR38","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02194921","volume":"13","author":"M.P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.P.: Sur le produit de concat\u00e9nation non ambigu. Semigroup Forum\u00a013(1), 47\u201375 (1976\/1977)","journal-title":"Semigroup Forum"},{"key":"5_CR39","unstructured":"Steinberg, B.: \u010cern\u00fd\u2019s conjecture and group representation theory (preprint) (2008)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Steinberg, B.: Yet another solution to the Burnside problem for matrix semigroups. Canad. Math. Bull. (to appear)","DOI":"10.4153\/CMB-2011-030-1"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/11821069_68","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A.N. Trahtman","year":"2006","unstructured":"Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the \u010cerny conjecture. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 789\u2013800. Springer, Heidelberg (2006)"},{"issue":"2","key":"5_CR42","first-page":"3","volume":"9","author":"A.N. Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci.\u00a09(2), 3\u201310 (2007) (electronic)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T04:25:12Z","timestamp":1558412712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}