×

zbMATH — the first resource for mathematics

La finitude des représentations linéaires des semi-groupes est decidable. (French) Zbl 0374.20074

MSC:
20M20 Semigroups of transformations, relations, partitions, etc.
15A30 Algebraic systems of matrices
20M10 General structure theory for semigroups
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Brzozowski, J.A.; Simon, I., Characterizations of locally testable events, Discrete math., 4, 243-271, (1973) · Zbl 0255.94032
[2] \scG. Jacob, Un théorème de factorisation des produits d’endomorphismes de KN, J. Algebra,àparaître. · Zbl 0441.16002
[3] Jacob, G., On peut décider si un semi-groupe de matrices est fini, Theoretical computer sci., 5, 183-204, (1977)
[4] Kaplansky, I., Fields and rings, () · Zbl 0203.34601
[5] McNaughton, R., Algebraic decision procedures for local testability, Math. systems theory, 8, 60-76, (1974) · Zbl 0287.02022
[6] McNaughton, R.; Zalcstein, Y., The Burnside theorem for semi-groups, J. algebra, 34, 292-299, (1975) · Zbl 0302.20054
[7] Procesi, C., The Burnside problem, J. algebra, 4, 421-425, (1966) · Zbl 0152.00301
[8] Schur, I., Über gruppen periodischer substitutionen, Sitzungsber. preuss. akad. wiss., 619-627, (1911) · JFM 42.0155.01
[9] Schutzenberger, M.P., On finite monoids having only trivial subgroups, Inform. contr., 8, 190-194, (1965) · Zbl 0131.02001
[10] Suprunenko, D.; Suprunenko, D., Soluble and nilpotent linear groups, (), (1958) · Zbl 0041.15902
[11] Zalcstein, Y., Locally testable semigroups, (), 216-227 · Zbl 0273.20049
[12] Zalcstein, Y., Finiteness conditions for matrix semigroups, (), 247-249 · Zbl 0238.20088
[13] Zalcstein, Y., Syntactic semigroups of some classes of star-free languages, () · Zbl 0277.94039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.