Sciweavers

STACS
2009
Springer

Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata

14 years 7 months ago
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
Abstract. 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.
Daniel Kirsten, Sylvain Lombardy
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where STACS
Authors Daniel Kirsten, Sylvain Lombardy
Comments (0)