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

Simple item page
dc.creatorKlimann, Ines
dc.creatorLombardy, Sylvain
dc.creatorMairesse, Jean
dc.creatorPrieur, Christophe
dc.date2007-09-26
dc.date.accessioned2026-07-07T08:32:18Z
dc.date.available2026-07-07T08:32:18Z
dc.descriptionFinite 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.
dc.identifierhttps://arxiv.org/abs/0709.4117
dc.identifierhttp://arxiv.org/abs/0709.4117
dc.identifierTheoretical Computer Science 327, 3 (2004) 349-373
dc.identifierdoi:10.1016/j.tcs.2004.02.049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138757
dc.subjectComputational Complexity
dc.titleDeciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton
dc.typetext

Files

Collections

arXiv