From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata

Details From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata

2007-05-15

arxiv.org/abs/0705.2205v2

Computer Science

Logic in Computer Science

21 pages. To appear in Logical Methods in Computer Science (LMCS)

Scientific paper

In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in numerous applications, such as reasoning about tree automata, satisfiability of CTL*, and realizability and synthesis of logical specifications. The upper bounds for all these applications are reduced by using the smaller deterministic automata produced by our construction. In addition, the parity acceptance conditions allows to use more efficient algorithms (when compared to handling Rabin or Streett acceptance conditions).

Affiliated with

Also associated with

No associations

Rating

From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata 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 From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623348