On semigroups of matrices over the tropical semiring

 Access to full text

 Full (PDF)

1. 1. S. EILENBERG, Automata, Languages, and Machines, Volume A, Academic Press, New York, 1974. Zbl0317.94045MR530382
2. 2. K. HASHIGUCHI, Limitedness theorem on finite automata with distance functions, J. Comput. Syst. Sci., 1982, 24, pp. 233-244. Zbl0513.68051MR661652
3. 3. K. HASHIGUCHI, Improved limitedness theorems on finite automata with distance functions, Theoretical Comput. Sci., 1990, 72. Zbl0693.68031MR1065598
4. 4. H. LEUNG, An Algebraic Method for Solving Decision Problems in Finite Automata Theory, PhD thesis, Department of Computer Science, The Pennsylvania State University, 1987. 
5. 5. H. LEUNG, On the topological structure of a finitely generated semigroup of matrices, Semigroup Forum, 1988, 37, pp. 273-287. Zbl0646.20056MR944662
6. 6. I. SIMON, Limited subsets of a free monoid, In Proc. 19th Annual Symposium on Foundations of Computer Science, Piscataway, N. J., 1978, Institute of Electrical and Electronics Engineers, pp. 143-150. MR539835
7. 7. I. SIMON, Recognizable sets with multiplicities in the tropical semiring. In M. P. Chytil, L. Janiga, and V. Koubek, Eds., Mathematical Foundations of Computer Science, Berlin, 1988. Springer-Verlag, Lectures Notes in Computer Science, 324, pp. 107-120. Zbl0656.68086MR1023416
8. 8. I. SIMON, Factorization forests of finite height, Theoretical Comput. Sci., 1990, 72, pp. 65-94. Zbl0693.68044MR1065601
9. 9. I. SIMON, The nondeterministic complexity of a finite automaton, In M. Lothaire, Ed, Mots - mélanges offerts à M. P. Schützenberger, Hermès, Paris, 1990, pp. 384-400. MR1252678

1. Nami Kobayashi, The closure under division and a characterization of the recognizable $𝒵$-subsets
2. Daniel Kirsten, Distance desert automata and the star height problem
3. Daniel Kirsten, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
4. Daniel Kirsten, Distance desert automata and the star height problem