The following pages link to On finite semigroups of matrices (Q1243001):
Displayed 19 items.
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- The Whitney embedding theorem for tropical torsion modules. Classification of tropical modules (Q550681) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- On the topological structure of a finitely generated semigroup of matrices (Q1103733) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Examples of undecidable problems for 2-generator matrix semigroups (Q1275458) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- Efficient algorithms for deciding the type of growth of products of integer matrices (Q2483266) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
- (Q3334093) (← links)
- Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
- On Nonnegative matrices generating a finite multiplicative monoid (Q3978322) (← links)
- Some decision problems on integer matrices (Q4680730) (← links)
- The finiteness problem for monoids of morphisms (Q5245727) (← links)
- On finitely generated monoids of matrices with entries in $\mathbb {N}$ (Q5752758) (← links)