paper

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

arXiv:0709.4117 · doi:10.1016/j.tcs.2004.02.049

Abstract

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.

Cited by in corpus (1)

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton · wovepaper