On finitely generated monoids of matrices with entries in ℕ
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 19-38. 
@article{ITA_1991__25_1_19_0,
     author = {Weber, Andreas and Seidl, Helmut},
     title = {On finitely generated monoids of matrices with entries in $\mathbb {N}$},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {19--38},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {1},
     year = {1991},
     mrnumber = {1104408},
     zbl = {0721.20042},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_1_19_0/}
}
TY  - JOUR
AU  - Weber, Andreas
AU  - Seidl, Helmut
TI  - On finitely generated monoids of matrices with entries in $\mathbb {N}$
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 19
EP  - 38
VL  - 25
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_1_19_0/
LA  - en
ID  - ITA_1991__25_1_19_0
ER  - 
%0 Journal Article
%A Weber, Andreas
%A Seidl, Helmut
%T On finitely generated monoids of matrices with entries in $\mathbb {N}$
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 19-38
%V 25
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_1_19_0/
%G en
%F ITA_1991__25_1_19_0
Weber, Andreas; Seidl, Helmut. On finitely generated monoids of matrices with entries in $\mathbb {N}$. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 19-38. http://www.numdam.org/item/ITA_1991__25_1_19_0/

ChI83. T.-H. Chan and O. Ibarra, On the Finite-Valuedness Problem for Sequential Machines, TCS, 1983, 23, pp. 95-101. | MR | Zbl

E74. S. Eilenberg, Automata, Languages, and Machines, Academic Press, New York, N.Y., 1974, A. | MR | Zbl

Hs78. M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. | MR | Zbl

HoU79. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass., 1979. | MR | Zbl

Ja77. G. Jacob, Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices, T.C.S., 1977, 5, pp. 183-204. | MR | Zbl

Ku88. W. Kuich, Finite Automata and Ambiguity, Report 253 of the IIG, Technische Universität Graz, 1988.

La09. E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Teubner, Leipzig, 1909. | JFM

Le87. H. Leung, An Algebraic Method for Solving Decision Problems in Finite Automata Theory, Ph. D. Thesis, The Pennsylvania State University, 1987.

MaSi77. A Mandel and I. Simon, On Finite Semigroups of Matrices, T.C.S., 1977, 5, pp. 101-111. | MR | Zbl

Ms84.1. J.-P. Massias, Ordre maximum d'un élément du groupe symétrique et applications, Thèse 3e cycle, Université de Limoges, 1984.

Ms84.2. J.-P. Massias, Majoration explicite de l'ordre maximum d'un élément du groupe symétrique, Annales Faculté des Sciences Toulouse, 1984, VI, pp. 269-281. | Numdam | MR | Zbl

MsNRo88. J.-P. Massias, J.-L. Nicolas and G. Robin, Evaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique, Acta Arithmetica, 1988, 50, pp. 221-242. | MR | Zbl

McZ75. R. Mcnaughton and Y. Zalcstein, The Burnside Problem for Semi-groups, J. Algebra, 1975, 34, pp. 292-299. | MR | Zbl

Re77. C. Reutenauer, Propriétés arithmétiques et topologiques de séries rationnelles en variables non commutatives, Thèse 3e cycle, Université Paris-VI, 1977.

Se89. H. Seidl, On the Finite Degree of Ambiguity of Finite Tree Automata, Acta Informatica, 1989, 26, pp. 527-542. | MR | Zbl

Sr88. L. Staiger, personal communication.

WeSe86. A. Weber and H. Seidl, On the Degree of Ambiguity of Finite Automata, Proc. M.F.C.S., 1986, in: L.N.C.S. 233, Springer-Verlag, pp. 620-629. | MR | Zbl

Tu90 P. Turakainen, On the Finitness of the Multiplicative Monoid generated by a Nonnegative Matrix. Bull. EATCS, 1990, 40, pp. 270-272. | Zbl

We87. A. Weber, Über die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern, Dissertation, Goethe-Universität Frankfurt am Main, 1987.

WeSe88. A. Weber and H. Seidl, On the Degree of Ambiguity of Finite Automata, Preprint, Goethe-Universität Frankfurt am Main, 1988, T.C.S. (to appear). | MR | Zbl