Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

TACAS
2005
Springer

favoriteEmaildiscussreport

86views Algorithms» more TACAS 2005»

Complementation Constructions for Nondeterministic Automata on Infinite Words

13 years 10 months ago

Complementation Constructions for Nondeterministic Automata on Infinite Words

Download www.cs.huji.ac.il

Orna Kupferman, Moshe Y. Vardi

Real-time Traffic

Algorithms | TACAS 2005 |

claim paper

Related Content

» On the Succinctness of Nondeterminism

» Global ModelChecking of InfiniteState Systems

» MeanPayoff Automaton Expressions

» On the Construction of Fine Automata for Safety Properties

» From Bidirectionality to Alternation

» The Weakness of SelfComplementation

» Factorisation Forests for Infinite Words

» Tight Upper Bounds for Streett and Parity Complementation

» Variable Automata over Infinite Alphabets

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	TACAS
Authors	Orna Kupferman, Moshe Y. Vardi

Comments (0)