Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=2500

• Automata, Logics, and Infinite Games - A Guide to Current Research
  Lecture Notes in Computer Science 2500, 2002, pp. viii, 385
• \omega-automata
  Berndt Farwer
  Lecture Notes in Computer Science 2500, 2002, pp. 3-21
• Infinite games
  René Mazala
  Lecture Notes in Computer Science 2500, 2002, pp. 23-38
• Determinization of Büchi-automata
  Markus Roggenbach
  Lecture Notes in Computer Science 2500, 2002, pp. 43-60
• Complementation of Büchi automata using alternation
  Felix Klaedtke
  Lecture Notes in Computer Science 2500, 2002, pp. 61-77
• Determinization and complementation of Streett automata
  Stefan Schwoon
  Lecture Notes in Computer Science 2500, 2002, pp. 79-91
• Memoryless determinacy of parity games
  Ralf Küsters
  Lecture Notes in Computer Science 2500, 2002, pp. 95-106
• Algorithms for parity games
  Hartmut Klauck
  Lecture Notes in Computer Science 2500, 2002, pp. 107-129
• Nondeterministic tree automata
  Frank Nie\ssner
  Lecture Notes in Computer Science 2500, 2002, pp. 135-152
• Alternating tree automata and parity games
  Daniel Kirsten
  Lecture Notes in Computer Science 2500, 2002, pp. 153-167
• Modal \mu-calculus and alternating tree automata
  Júlia Zappe
  Lecture Notes in Computer Science 2500, 2002, pp. 171-184
• Strictness of the modal \mu-calculus hierarchy
  Luca Alberucci
  Lecture Notes in Computer Science 2500, 2002, pp. 185-203
• Decidability of S1S and S2S
  Mark Weyer
  Lecture Notes in Computer Science 2500, 2002, pp. 207-230
• The complexity of translating logic to finite automata
  Klaus Reinhardt
  Lecture Notes in Computer Science 2500, 2002, pp. 231-238
• Expressive power of monadic second-order logic and modal \mu-calculus
  Philipp Rohde
  Lecture Notes in Computer Science 2500, 2002, pp. 239-257
• Prefix-recognizable graphs and monadic logic
  Martin Leucker
  Lecture Notes in Computer Science 2500, 2002, pp. 263-283
• The monadic theory of tree-like structures
  Dietmar Berwanger, Achim Blumensath
  Lecture Notes in Computer Science 2500, 2002, pp. 285-301
• Two-way tree automata solving pushdown games
  Thierry Cachat
  Lecture Notes in Computer Science 2500, 2002, pp. 303-317
• Introduction to guarded logics
  Thoralf Räsch
  Lecture Notes in Computer Science 2500, 2002, pp. 321-341
• Aautomata for guarded fixed point logics
  Dietmar Berwanger, Achim Blumensath
  Lecture Notes in Computer Science 2500, 2002, pp. 343-355
• Some fixed point basics
  Carsten Fritz
  Lecture Notes in Computer Science 2500, 2002, pp. 359-364