Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices

DOI10.1016/0304-3975(77)90006-8zbMath0388.15001OpenAlexW2050431915MaRDI QIDQ1250142

Gérard Jacob

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90006-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Matrix equations and identities (15A24) Algebraic theory of languages and automata (68Q70) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items

On some arithmetic properties of Mahler functions, On the decidability of semigroup freeness, Matrix semigroups with constant spectral radius, On the degree of ambiguity of finite automata, GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS, Efficient algorithms for deciding the type of growth of products of integer matrices, Unnamed Item, On finitely generated monoids of matrices with entries in $\mathbb {N}$, La finitude des représentations linéaires des semi-groupes est decidable, Matrix Mortality and the Černý-Pin Conjecture, Decidability and \(k\)-regular sequences, The boundedness of all products of a pair of matrices is undecidable

Cites Work

• The Burnside problem for semigroups
• Matrices de Hankel
• La finitude des représentations linéaires des semi-groupes est decidable
• Locally testable semigroups
• The Burnside problem
• Characterizations of locally testable events
• Solvability of the problem of occurrence in finitely generated soluble groups of matrices over the field of algebraic numbers
• On a Theorem of R. Jungen
• Decidabilite de la finitude des demi-groupes de matrices
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• Finiteness Conditions for Matrix Semigroups
• Finite counting automata
• Unnamed Item
• Unnamed Item
• Unnamed Item