A tighter analysis of Piterman's Büchi determinization

DOI10.1016/j.ipl.2009.04.022zbMath1200.68147OpenAlexW1983662674MaRDI QIDQ989532

Ji Wang, Wanwei Liu

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.022

zbMATH Keywords

automata theoryanalysis of algorithmsformal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Tighter Bounds for the Determinisation of Büchi Automata ⋮ Rabin vs. Streett Automata

Cites Work

• Unnamed Item
• Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
• Tighter Bounds for the Determinisation of Büchi Automata
• Büchi Complementation Made Tight
• Automated Technology for Verification and Analysis
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: A tighter analysis of Piterman's Büchi determinization