1.

Record Nr.

UNISA996465633903316

Titolo

Fundamentals of Computation Theory [[electronic resource] ] : 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings / / edited by Miroslaw Kutylowski, Maciej Gebala, Witold Charatonik

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009

ISBN

3-642-03409-8

Edizione

[1st ed. 2009.]

Descrizione fisica

1 online resource (XIII, 357 p.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5699

Classificazione

DAT 542f

SS 4800

Disciplina

004n/a

Soggetti

Computer programming

Compilers (Computer programs)

Computer science

Algorithms

Machine theory

Programming Techniques

Compilers and Interpreters

Theory of Computation

Formal Languages and Automata Theory

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Invited 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.

Sommario/riassunto

This 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.