On finitely generated monoids of matrices with entries in $\mathbb {N}$

DOI10.1051/ita/1991250100191zbMath0721.20042OpenAlexW97187568MaRDI QIDQ5752758

Helmut Seidl, Andreas Weber

Publication date: 1991

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92377

zbMATH Keywords

Landau's functionmultiplicative monoidexact boundfinite set of n by n matrices

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Related Items

Exponential upper and lower bounds for the order of a regular language, On Nonnegative matrices generating a finite multiplicative monoid, The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case, Distance automata having large finite distance or finite ambiguity, On the degree of ambiguity of finite automata, A note on finitely ambiguous distance automata, On finite monoids over nonnegative integer matrices and short killing words, On Nonnegative Integer Matrices and Short Killing Words, Unnamed Item

Cites Work

• On the finite-valuedness problem for sequential machines
• On the degree of ambiguity of finite automata
• The Burnside problem for semigroups
• On finite semigroups of matrices
• Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
• On the finite degree of ambiguity of finite tree automata
• Majoration explicite de l'ordre maximum d'un élément du groupe symétrique
• Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item