A tighter analysis of Piterman's Büchi determinization
type: Item
instance of: scholarly article
title: A tighter analysis of Piterman's Büchi determinization
zbMATH Open document ID: 1200.68147
author: Wanwei Liu
author: Ji Wang
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5773829
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: formal languages
zbMATH Keywords: automata theory
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.04.022
OpenAlex ID: W1983662674
cites work: Automated Technology for Verification and Analysis
cites work: Q4501665
cites work: Testing and generating infinite sequences by a finite automaton
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Büchi Complementation Made Tight
cites work: Tighter Bounds for the Determinisation of Büchi Automata
cites work: Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
DOI: 10.1016/J.IPL.2009.04.022
Recommended article: Tighter Bounds for the Determinisation of Büchi Automata
Recommended article: A Modular Approach for Büchi Determinization.
Recommended article: Implementation and Application of Automata
Recommended article: Observations on determinization of Büchi automata
Recommended article: A Buchsbaum theory for tight closure
Recommended article: Determinization of Büchi-Automata
Recommended article: Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Recommended article: Q5092321
Recommended article: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
Recommended article: The Logical Strength of Büchi's Decidability Theorem
description: scientific article; zbMATH DE number 5773829