LEADER 04552nam 2200613Ia 450 001 9910483734003321 005 20200520144314.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 $a20070817d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of computation theory $e17th international symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009 : proceedings /$fMiroslaw Kutylowsky, Witold Charatonik, Maciej Gebala (eds.) 205 $a1st ed. 2009. 210 $aBerlin ;$aHeidelberg $cSpringer$dc2009 215 $a1 online resource (XIII, 357 p.) 225 1 $aLecture notes in computer science ;$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$aLecture notes in computer science ;$v5699. 606 $aMachine theory$vCongresses 606 $aComputational complexity$vCongresses 615 0$aMachine theory 615 0$aComputational complexity 676 $a004n/a 686 $aDAT 542f$2stub 686 $aSS 4800$2rvk 701 $aKutylowsky$b Miroslaw$01751572 701 $aCharatonik$b Witold$01751573 701 $aGebala$b Maciej$01075274 712 12$aFCT 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483734003321 996 $aFundamentals of computation theory$94186562 997 $aUNINA