In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automaton that runs on… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Stefan Ellmauthaler, Johannes Peter Wallner
- COMMA
- 2012

A widespread modeling language for abstract argumentation is the argumentation framework due to Dung [1]. However relating… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Nir Piterman
- 21st Annual IEEE Symposium on Logic in Computer…
- 2006

In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states… (More)

Is this relevant?

2006

2006

- Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
- ICALP
- 2006

The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Orna Kupferman, Moshe Y. Vardi
- 46th Annual IEEE Symposium on Foundations of…
- 2005

The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical… (More)

Is this relevant?

2004

2004

- Shmuel Safra
- 2004

In [Saf88] an exponential determinization procedure for Büchi automata was shown, yielding tight bounds for decision procedures… (More)

Is this relevant?

2001

2001

- Christof Löding
- 2001

We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize… (More)

Is this relevant?

2001

2001

- Klaus Schneider
- LPAR
- 2001

We present new algorithms to translate linear time temporal logic (LTL) formulas with past operators to equivalent ω-automata… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Amir Pnueli, Roni Rosner
- POPL
- 1989

We consider the synthesis of a reactive module with input <italic>x</italic> and output <italic>y</italic>, which is specified by… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Shmuel Safra
- 1989

We investigate in this thesis problems concerning the complexity of translation among, and decision procedure for, di erent types… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Shmuel Safra
- FOCS
- 1988

Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order… (More)

Is this relevant?