default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIn Honor of Wolfgang Thomas 2008
- Jörg Flum, Erich Grädel, Thomas Wilke:
Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games 2, Amsterdam University Press 2008, ISBN 978-90-5356-576-6 - André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski:
On the topological complexity of tree languages. Logic and Automata 2008: 9-28 - André Arnold, Igor Walukiewicz:
Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52 - Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen:
Reachability in continuous-time Markov reward decision processes. Logic and Automata 2008: 53-72 - Achim Blumensath, Thomas Colcombet, Christof Löding:
Logical theories and compatible operations. Logic and Automata 2008: 73-106 - Mikolaj Bojanczyk, Igor Walukiewicz:
Forest algebras. Logic and Automata 2008: 107-132 - Olivier Carton, Dominique Perrin, Jean-Eric Pin:
Automata and semigroups recognizing infinite words. Logic and Automata 2008: 133-168 - Didier Caucal:
Deterministic graph grammars. Logic and Automata 2008: 169-250 - Bruno Courcelle:
Quantifier-free definable graph operations preserving recognizability. Logic and Automata 2008: 251-260 - Volker Diekert, Paul Gastin:
First-order definable languages. Logic and Automata 2008: 261-306 - Dora Giammarresi, Antonio Restivo:
Matrix-based complexity functions and recognizable picture languages. Logic and Automata 2008: 307-330 - Hugo Gimbert, Wieslaw Zielonka:
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. Logic and Automata 2008: 331-356 - Martin Grohe:
Logic, graphs, and algorithms. Logic and Automata 2008: 357-422 - Stephan Kreutzer, Martin Lange:
Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456 - Sylvain Lombardy, Jacques Sakarovitch:
The universal automaton. Logic and Automata 2008: 457-504 - Wim Martens, Frank Neven, Thomas Schwentick:
Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 - Oliver Matz, Nicole Schweikardt:
Expressive power of monadic logics on words, trees, pictures, and graphs. Logic and Automata 2008: 531-552 - Ramaswamy Ramanujam, Sunil Easaw Simon:
Structured strategies in games on graphs. Logic and Automata 2008: 553-574 - Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Counting in trees. Logic and Automata 2008: 575-612 - Howard Straubing, Denis Thérien:
Modular quantifiers. Logic and Automata 2008: 613-628 - Moshe Y. Vardi, Thomas Wilke:
Automata: from logics to algorithms. Logic and Automata 2008: 629-736
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-28 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
