|
|
|
|
| LEADER |
03815nam a22006255i 4500 |
| 001 |
978-3-642-03092-5 |
| 003 |
DE-He213 |
| 005 |
20151204153012.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642030925
|9 978-3-642-03092-5
|
| 024 |
7 |
|
|a 10.1007/978-3-642-03092-5
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TJ210.2-211.495
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a TJFM1
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Infinity in Logic and Computation
|h [electronic resource] :
|b International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /
|c edited by Margaret Archibald, Vasco Brattka, Valentin Goranko, Benedikt Löwe.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
|
|
|a XIII, 139 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5489
|
| 505 |
0 |
|
|a 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?.
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 700 |
1 |
|
|a Archibald, Margaret.
|e editor.
|
| 700 |
1 |
|
|a Brattka, Vasco.
|e editor.
|
| 700 |
1 |
|
|a Goranko, Valentin.
|e editor.
|
| 700 |
1 |
|
|a Löwe, Benedikt.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642030918
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5489
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-03092-5
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
