Location of Repository

Deciding the sequentiality of a finitely ambiguous Max-Plus automaton

By Ines Klimann, Sylvain Lombardy, Jean Mairesse and Christophe Prieur

Abstract

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 sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity

Topics: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Publisher: Springer-Verlag
Year: 2003
OAI identifier: oai:HAL:hal-00017208v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.