Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton
Computational Complexity
2007-09-27 v1
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.
Cite
@article{arxiv.0709.4117,
title = {Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton},
author = {Ines Klimann and Sylvain Lombardy and Jean Mairesse and Christophe Prieur},
journal= {arXiv preprint arXiv:0709.4117},
year = {2007}
}