The last ten years saw the emergence of some results about recognizable subsets of a free monoid with multiplicities in the Min-Plus semiring. An interesting aspect of this theoretical body is that its discovery was motivated throughout by applications such as the finite power property, Eggan’s classical star height problem and the measure of the nondeterministic complexity of finite automata. We review here these results, their applications and point out some open problems.
CITATION STYLE
Simon, I. (1988). Recognizable sets with multiplicities in the tropical semiring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 324 LNCS, pp. 107–120). Springer Verlag. https://doi.org/10.1007/BFb0017135
Mendeley helps you to discover research relevant for your work.