From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata

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 automat...

תיאור מלא

מידע ביבליוגרפי

מחבר ראשי:	Nir Piterman
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Logical Methods in Computer Science e.V. 2007-08-01
סדרה:	Logical Methods in Computer Science
נושאים:	computer science - logic in computer science computer science - formal languages and automata theory f.1.1 f.4.3
גישה מקוונת:	https://lmcs.episciences.org/1199/pdf
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!