 |
Journal articles
Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus Automaton
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 unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.
Cited literature [26 references]
https://hal.archives-ouvertes.fr/hal-00174171
Contributor : Sylvain Lombardy <>
Submitted on : Wednesday, September 26, 2007 - 9:59:47 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM
Long-term archiving on: : Friday, April 9, 2010 - 2:38:13 AM
Contributor : Sylvain Lombardy <>
Submitted on : Wednesday, September 26, 2007 - 9:59:47 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM
Long-term archiving on: : Friday, April 9, 2010 - 2:38:13 AM
Files
seq-arXiv.pdf
Files produced by the author(s)