La finitude des représentations linéaires des semi-groupes est decidable

DOI10.1016/0021-8693(78)90249-1zbMath0374.20074OpenAlexW2054326409MaRDI QIDQ1245319

Gérard Jacob

Publication date: 1978

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(78)90249-1

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic systems of matrices (15A30)

Related Items

Rational languages and the Burnside problem, On the topological structure of a finitely generated semigroup of matrices, On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra, On images of D0L and DT0L power series., Generalized cancellation-and-permutation properties, regular languages and supports of rational series, Rational relations and rational series, Sequential?, Some decision problems on integer matrices, On finite semigroups of matrices, Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices, Determinisability of unary weighted automata over the rational numbers, Examples of undecidable problems for 2-generator matrix semigroups, Decidability and \(k\)-regular sequences, A combinatorial property and growth for semigroups of matrices, The finiteness problem for monoids of morphisms, The cyclicity problem for the images of Q-rational series, On D0L systems with immigration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Un théorème de factorisation des produits d'endomorphismes de \(K^N\)
• The Burnside problem for semigroups
• Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
• Locally testable semigroups
• The Burnside problem
• Characterizations of locally testable events
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• Finiteness Conditions for Matrix Semigroups