Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00360205
Contributor : Publications Loria <>
Submitted on : Tuesday, February 10, 2009 - 4:21:35 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 8:38:24 PM

File

49-kirsten.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00360205, version 1

Citation

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⟩

Share

Metrics

Record views

476

Files downloads

410