30.01.2014 Views

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Talks <strong>an</strong>d Publications<br />

Talks<br />

W. Fridm<strong>an</strong>: Six Types of Pushdown Games, GASICS Meeting, <strong>Aachen</strong>, Germ<strong>an</strong>y, October<br />

2009<br />

W. Fridm<strong>an</strong>: Solvability of X-Pushdown-Games with X-Pushdown-Strategies, AlgoSyn<br />

Workshop <strong>2010</strong>, Rolduc, Netherl<strong>an</strong>ds, March <strong>2010</strong><br />

W. Fridm<strong>an</strong>: Formats of Winning Strategies for Six Types of Pushdown Games, G<strong>an</strong>dALF<br />

<strong>2010</strong>, Minori, Italy, June <strong>2010</strong><br />

M. Holtm<strong>an</strong>n: Degrees of Lookahead in Regular Infinite Games, Seminar of AlgoSyn<br />

Research Training Group, <strong>Aachen</strong>, November 2009<br />

M. Holtm<strong>an</strong>n: Degrees of Lookahead in Regular Infinite Games, 13th International<br />

Conference on Foundations of Software Science <strong>an</strong>d Computation Structures, Paphos,<br />

Cyprus, March <strong>2010</strong><br />

C. Löding: Automata for Boundedness Problems on Trees, Workshop on Dist<strong>an</strong>ce Automata,<br />

Paris, Fr<strong>an</strong>ce, November 16, 2009<br />

C. Löding: Boundedness Problems for Finite Automata, CFV Seminar, Brussels, Belgium,<br />

November 27, 2009<br />

C. Löding: Finite Set Interpretations <strong>an</strong>d Tree Automatic Structures of Higher Or<strong>der</strong>,<br />

Workshop on Higher-Or<strong>der</strong> Recursion Schemes & Pushdown Automata, Paris, Fr<strong>an</strong>ce, March<br />

10, <strong>2010</strong><br />

C. Löding: Equivalence <strong>an</strong>d Inclusion Problem for Strongly Unambiguous Büchi Automata,<br />

4th International Conference on L<strong>an</strong>guage <strong>an</strong>d Automata Theory <strong>an</strong>d Applications, Trier,<br />

Germ<strong>an</strong>y, May 25, <strong>2010</strong><br />

C. Löding: Infinite Games <strong>an</strong>d Program Synthesis from Logical Specifications, Tutorial at<br />

ASE <strong>2010</strong>, Antwerp, Belgium, September 20, <strong>2010</strong><br />

D. Nei<strong>der</strong>: Learning to Win Reachability Games, Workshop on Timed <strong>an</strong>d Infinite Systems,<br />

Warwick, UK, March 31, <strong>2010</strong><br />

D. Nei<strong>der</strong>: Winning Reachability Games, Seminar of AlgoSyn Research Training Group,<br />

<strong>Aachen</strong>, April 15, <strong>2010</strong><br />

D. Nei<strong>der</strong>: libalf: the Automata Learning Framework, CAV <strong>2010</strong>, Edinburgh, UK, July 17,<br />

<strong>2010</strong><br />

D. Nei<strong>der</strong>: Reachability Games on Automatic Graphs, CIAA <strong>2010</strong>, Winnipeg, C<strong>an</strong>ada,<br />

August 12, <strong>2010</strong><br />

J. Olschewski: The Complexity of Finding Reset Words in Finite Automata, MFCS <strong>2010</strong>,<br />

Brno, Czech Republic, August 23, <strong>2010</strong><br />

J. Olschewski: The Complexity of Finding Reset Words in Finite Automata, at TEMPO <strong>an</strong>d<br />

MexICo of LSV, ENS Cach<strong>an</strong>, Paris, Fr<strong>an</strong>ce, June 23, <strong>2010</strong><br />

F. Radmacher: A game-theoretic approach to routing un<strong>der</strong> adversarial conditions, 6th IFIP<br />

International Conference on Theoretical Computer Science, IFIP TCS <strong>2010</strong>, Brisb<strong>an</strong>e,<br />

Australia, September 23, <strong>2010</strong><br />

260

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!