On finitely generated monoids of matrices with entries in N
暂无分享,去创建一个
[1] Jean-Pierre Massias,et al. Majoration explicite de l'ordre maximum d'un élément du groupe symétrique , 1984 .
[2] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[3] Jean-Louis Nicolas,et al. Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique , 1988 .
[4] E. Landau. Handbuch der Lehre von der Verteilung der Primzahlen , 1974 .
[5] Helmut Seidl,et al. On the Degree of Ambiguity of Finite Automata , 1986, MFCS.
[6] Gérard Jacob,et al. Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices , 1977, Theor. Comput. Sci..
[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[8] Yechezkel Zalcstein,et al. The Burnside problem for semigroups , 1975 .
[9] Imre Simon,et al. On Finite Semigroups of Matrices , 1977, Theor. Comput. Sci..
[10] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[11] Hing Leung. An algebraic method for solving decision problems in finite automata theory , 1987 .
[12] Oscar H. Ibarra,et al. On the Finite-Valuedness Problem for Sequential Machines , 1983, Theor. Comput. Sci..