2000 character limit reached
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton
Published 26 Sep 2007 in cs.CC | (0709.4117v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
