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

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

2007-09-26

arxiv.org/abs/0709.4117v1

Theoretical Computer Science 327, 3 (2004) 349-373

Computer Science

Computational Complexity

Scientific paper

10.1016/j.tcs.2004.02.049

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.

Affiliated with

Also associated with

No associations

Rating

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694718