Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata

Daniel Kirsten (1) , Sylvain Lombardy (2)

1 Institut for Computer Science
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Mots clés: min-plus automata; determinization; finite semigroups

Domaines: Informatique et langage [cs.CL]

Daniel Kirsten, Sylvain Lombardy. Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.589-600. ⟨inria-00360205⟩