Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
49-kirsten.pdf (226.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00360205 , version 1 (10-02-2009)

Identifiers

  • HAL Id : inria-00360205 , version 1

Cite

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⟩
285 View
440 Download

Share

Gmail Facebook X LinkedIn More