000 04191nam a22006615i 4500
001 978-3-642-03092-5
003 DE-He213
005 20240730184444.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642030925
_9978-3-642-03092-5
024 7 _a10.1007/978-3-642-03092-5
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aInfinity in Logic and Computation
_h[electronic resource] :
_bInternational Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /
_cedited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIII, 139 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v5489
505 0 _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?.
520 _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.
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aMachine theory.
_9135613
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aProgramming Techniques.
_9135614
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aTheory of Computation.
_9135615
650 2 4 _aAlgorithms.
_93390
650 2 4 _aFormal Languages and Automata Theory.
_9135616
700 1 _aArchibald, Margaret.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135617
700 1 _aBrattka, Vasco.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135618
700 1 _aGoranko, Valentin F.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135619
700 1 _aLöwe, Benedikt.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135620
710 2 _aSpringerLink (Online service)
_9135621
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642030918
776 0 8 _iPrinted edition:
_z9783642030932
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v5489
_9135622
856 4 0 _uhttps://doi.org/10.1007/978-3-642-03092-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92336
_d92336