LEADER 05307nam 22007695 450 001 996465633903316 005 20230406071531.0 010 $a3-642-03409-8 024 7 $a10.1007/978-3-642-03409-1 035 $a(CKB)1000000000784726 035 $a(SSID)ssj0000317848 035 $a(PQKBManifestationID)11254905 035 $a(PQKBTitleCode)TC0000317848 035 $a(PQKBWorkID)10293998 035 $a(PQKB)11561409 035 $a(DE-He213)978-3-642-03409-1 035 $a(MiAaPQ)EBC3064587 035 $a(PPN)139954945 035 $a(EXLCZ)991000000000784726 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $e17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings /$fedited by Miroslaw Kutylowski, Maciej Gebala, Witold Charatonik 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 357 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5699 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-03408-X 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- How to Guard the Guards Themselves -- Alternating Weighted Automata -- Contributions -- Maintaining Arrays of Contiguous Objects -- The k-Anonymity Problem Is Hard -- Independence Results for n-Ary Recursion Theorems -- Depletable Channels: Dynamics and Behaviour -- Noise-Resilient Group Testing: Limitations and Constructions -- Martingales on Trees and the Empire Chromatic Number of Random Trees -- Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity -- Combinatorial Queries and Updates on Partial Words -- The Longest Haplotype Reconstruction Problem Revisited -- Earliest Query Answering for Deterministic Nested Word Automata -- Multiway In-Place Merging -- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs -- On Random Betweenness Constraints -- Directed Graphs of Entanglement Two -- Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies -- Computing Role Assignments of Chordal Graphs -- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL -- Closure Operators for Order Structures -- Correcting Sorted Sequences in a Single Hop Radio Network -- A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs -- Small-Space Analogues of Valiant?s Classes -- Small Weakly Universal Turing Machines -- Open Maps Bisimulations for Higher Dimensional Automata Models -- Decision Version of the Road Coloring Problem Is NP-Complete -- NP-Completeness of st-Orientations for Plane Graphs -- Equivalence of Deterministic Nested Word to Word Transducers -- Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space -- Energy Complexity and Depth of Threshold Circuits -- 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs. 330 $aThis book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5699 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aProgramming Techniques 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 14$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 $aDAT 542f$2stub 686 $aSS 4800$2rvk 702 $aKutylowski$b Miroslaw$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGebala$b Maciej$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCharatonik$b Witold$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFCT 2009 906 $aBOOK 912 $a996465633903316 996 $aFundamentals of Computation Theory$92557870 997 $aUNISA