| Description |
1 online resource : illustrations |
| Series |
Texts in logic and games ; vol. 2 |
|
Texts in logic and games ; v. 2.
|
| Contents |
Machine derived contents note: Preface On the topological complexity of tree languages Andre; Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski Nondeterministic controllers of nondeterministic processes Andre; Arnold, Igor Walukiewicz Reachability in continuous-time Markov reward decision processes Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen Logical theories and compatible operations Achim Blumensath, Thomas Colcombet, Christof Löding Forest algebras Mikolaj Bojanczyk, Igor Walukiewicz Automata and semigroups recognizing infinite words Olivier Carton, Dominique Perrin, Jean-Éric Pin Deterministic graph grammars Didier Caucal Quantifier-free definable graph operations preserving recognizability Bruno Courcelle First-order definable languages Volker Diekert, Paul Gastin Matrix-based complexity functions and recognizable picture languages Dora Giammarresi, Antonio Restivo Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games Hugo Gimbert, Wieslaw Zielonka Logic, graphs, and algorithms Martin Grohe Non-regular fixed-point logics and games Stephan Kreutzer, Martin Lange The universal automaton Sylvain Lombardy, Jacques Sakarovitch Deterministic top-down tree automata: past, present, and future Wim Martens, Frank Neven, Thomas Schwentick Expressive power of monadic logics on words, trees, pictures, and graphs Oliver Matz, Nicole Schweikardt Structured strategies in games on graphs R. Ramanujam, Sunil Simon Counting in trees Helmut Seidl, Thomas Schwentick, Anca Muscholl Modular quantifiers Howard Straubing, Denis The;rien Automata: from logics to algorithms Moshe Y. Vardi, Thomas Wilke |
| Summary |
This collection of papers deal with challenges in disciplines such as complexity theory, games, algorithms and semi group theory and discuss current chellenges in this field |
| Notes |
Title from PDF title page (viewed July 1, 2008) |
| Bibliography |
Includes bibliographical references |
| Notes |
English |
| In |
Books at JSTOR: Open Access JSTOR |
|
OAPEN (Open Access Publishing in European Networks) OAPEN |
| Subject |
Computer science -- Mathematics.
|
|
Logic, Symbolic and mathematical.
|
|
Game theory.
|
|
Computational complexity.
|
|
Machine theory.
|
|
Mathematics and science.
|
|
Science: general issues.
|
|
MATHEMATICS -- Infinity.
|
|
MATHEMATICS -- Logic.
|
|
COMPUTERS -- General.
|
|
Machine theory
|
|
Computational complexity
|
|
Computer science -- Mathematics
|
|
Game theory
|
|
Logic, Symbolic and mathematical
|
| Form |
Electronic book
|
| Author |
Flum, Jörg.
|
|
Grädel, Erich, 1958-
|
|
Wilke, Thomas, 1965-
|
| ISBN |
9789048501281 |
|
9048501288 |
|
