Simulation vs. Equivalence

Details Simulation vs. Equivalence Simulation vs. Equivalence

2010-04-14

arxiv.org/abs/1004.2426v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is called "proper". It is known that the Boolean semiring, the semiring of natural numbers, the ring of integers, all finite commutative positively ordered semirings and all fields are proper. The semiring S is Noetherian if every subsemimodule of a finitely generated S-semimodule is finitely generated. First, it is shown that all Noetherian semirings and thus all commutative rings and all finite semirings are proper. Second, the tropical semiring is shown not to be proper. So far there has not been any example of a semiring that is not proper.

Affiliated with

Also associated with

No associations

Rating

Simulation vs. Equivalence 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 Simulation vs. Equivalence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation vs. Equivalence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528068