LEADER 04248nam 22008295 450 001 9910483480503321 005 20251226203532.0 010 $a3-642-03092-0 024 7 $a10.1007/978-3-642-03092-5 035 $a(CKB)1000000000798304 035 $a(SSID)ssj0000318235 035 $a(PQKBManifestationID)11283545 035 $a(PQKBTitleCode)TC0000318235 035 $a(PQKBWorkID)10308724 035 $a(PQKB)11193449 035 $a(DE-He213)978-3-642-03092-5 035 $a(MiAaPQ)EBC3064706 035 $a(PPN)139958320 035 $a(EXLCZ)991000000000798304 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInfinity in Logic and Computation $eInternational Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /$fedited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 139 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v5489 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-03091-2 320 $aIncludes bibliographical references and index. 327 $aNadia 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?. 330 $aEdited 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. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v5489 606 $aArtificial intelligence 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial Intelligence 606 $aProgramming Techniques 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 14$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aCompilers and Interpreters. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 676 $a004n/a 686 $a004$2sdnb 686 $aDAT 500f$2stub 686 $aSS 4800$2rvk 701 $aArchibald$b Margaret$01750490 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483480503321 996 $aInfinity in Logic and Computation$94185136 997 $aUNINA