Deciding the sequentiality of a finitely ambiguous Max-Plus automaton

Ines Klimann (1) , Sylvain Lombardy (1) , Jean Mairesse (1) , Christophe Prieur (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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 sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.

Domaines: Mathématique discrète [cs.DM]

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. Deciding the sequentiality of a finitely ambiguous Max-Plus automaton. 2003, pp.373-385. ⟨hal-00017208⟩