Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus Automaton - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2004

Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus Automaton

Résumé

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.
Fichier principal
Vignette du fichier
seq-arXiv.pdf (327.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00174171 , version 1 (26-09-2007)

Identifiants

Citer

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus Automaton. Theoretical Computer Science, 2004, 327 (3), pp.349-373. ⟨10.1016/j.tcs.2004.02.049⟩. ⟨hal-00174171⟩
78 Consultations
306 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More