2,229 research outputs found
Green's J-order and the rank of tropical matrices
We study Green's J-order and J-equivalence for the semigroup of all n-by-n
matrices over the tropical semiring. We give an exact characterisation of the
J-order, in terms of morphisms between tropical convex sets. We establish
connections between the J-order, isometries of tropical convex sets, and
various notions of rank for tropical matrices. We also study the relationship
between the relations J and D; Izhakian and Margolis have observed that for the semigroup of all 3-by-3 matrices over the tropical semiring with
, but in contrast, we show that for all full matrix semigroups
over the finitary tropical semiring.Comment: 21 pages, exposition improve
Recommended from our members
Approximate comparison of distance automata
Distance automata are automata weighted over the semiring (N∪ {∞}, min,+) (the tropical semiring). Such automata compute functions from words to N
∪{∞} such as the number of occurrences of a given letter. It is known that testing f 0 and two functions f,g computed by distance automata, answers "yes" if f <= (1-ε ) g, "no" if f \not\leq g, and may answer "yes" or "no" in all other cases. This result highly refines previously known decidability results of the same type. The core argument behind this quasi-decision procedure is an algorithm which is able to provide an approximated finite presentation to the closure under products of sets of matrices over the tropical semiring. We also provide another theorem, of affine domination, which shows that previously known decision procedures for cost-automata have an improved precision when used over distance automata
Recommended from our members
Comparison of max-plus automata and joint spectral radius of tropical matrices
Weighted automata over the max-plus semiring S are closely related to finitely generated semigroups of matrices over S. In this paper, we use results in automata theory to study two quantities associated with sets of matrices: the joint spectral radius and the ultimate rank. We prove that these two quantities are not computable over the tropical semiring, i.e. there is no algorithm that takes as input a finite set of matrices M and provides as output the joint spectral radius (resp. the ultimate rank) of M. On the other hand, we prove that the joint spectral radius is nevertheless approximable and we exhibit restricted cases in which the joint spectral radius and the ultimate rank are computable. To reach this aim, we study the problem of comparing functions computed by weighted automata over the tropical semiring. This problem is known to be undecidable and we prove that it remains undecidable in some specific subclasses of automata
- …