Buch, Englisch, 139 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 248 g
International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers
Buch, Englisch, 139 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 248 g
Reihe: Lecture Notes in Artificial Intelligence
ISBN: 978-3-642-03091-8
Verlag: Springer
Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the Internatonal Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007.
The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
Weitere Infos & Material
Nadia Busi (1968–2007).- Symbolic Model Checking of Tense Logics on Rational Kripke Models.- Genetic Systems without Inhibition Rules.- Probabilistic Systems with LimSup and LimInf Objectives.- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata.- Towards Model-Checking Programs with Lists.- Representations of Numbers as:A Saddle Point Approach.- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata.- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions.- Is P?=?PSPACE for Infinite Time Turing Machines?.
