04248nam 22008295 450 991048348050332120251226203532.03-642-03092-010.1007/978-3-642-03092-5(CKB)1000000000798304(SSID)ssj0000318235(PQKBManifestationID)11283545(PQKBTitleCode)TC0000318235(PQKBWorkID)10308724(PQKB)11193449(DE-He213)978-3-642-03092-5(MiAaPQ)EBC3064706(PPN)139958320(EXLCZ)99100000000079830420100301d2009 u| 0engurnn#008mamaatxtccrInfinity in Logic and Computation International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /edited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (XIII, 139 p.)Lecture Notes in Artificial Intelligence,2945-9141 ;5489Bibliographic Level Mode of Issuance: Monograph3-642-03091-2 Includes bibliographical references and index.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?.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.Lecture Notes in Artificial Intelligence,2945-9141 ;5489Artificial intelligenceComputer programmingCompilers (Computer programs)Computer scienceAlgorithmsMachine theoryArtificial IntelligenceProgramming TechniquesCompilers and InterpretersTheory of ComputationAlgorithmsFormal Languages and Automata TheoryArtificial intelligence.Computer programming.Compilers (Computer programs).Computer science.Algorithms.Machine theory.Artificial Intelligence.Programming Techniques.Compilers and Interpreters.Theory of Computation.Algorithms.Formal Languages and Automata Theory.004n/a004sdnbDAT 500fstubSS 4800rvkArchibald Margaret1750490MiAaPQMiAaPQMiAaPQBOOK9910483480503321Infinity in Logic and Computation4185136UNINA