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.

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Daniel Kirsten, Sylvain Lombardy
• Keywords: Ambiguous Min-plus Automata, Decidable Algebraic Characterization, Sequentiality Problem, STACS 2009, Theoretical Computer Science