Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (2004)

by I Klimann, S Lombardy, J Mairesse, C Prieur
Venue:Theoret. Comput. Sci
Add To MetaCart
Results 1 - 1 of 1

DECIDING UNAMBIGUITY AND SEQUENTIALITY OF POLYNOMIALLY AMBIGUOUS MIN-PLUS AUTOMATA

by Daniel Kirsten, Sylvain Lombardy , 2009
"... This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characterization involving so-called metatransitions and an application of results from the structure theory of finite semigroups. It is n ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characterization involving so-called metatransitions and an application of results from the structure theory of finite semigroups. It is noteworthy that the equivalence problem is known to be undecidable for polynomially ambiguous automata.