Sciweavers

130
Voted
STACS
2009
Springer
16 years 12 days 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 characte...
Daniel Kirsten, Sylvain Lombardy