This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, logic in computer science, semantics, specification, and verification of programs, rewriting and deduction, as well as current challenges like biological computing, quantum computing, and mobile and net computing.problem (k-PLSE) is, given a PLS L of order n, color the maximum number of empty cells in L by colors in [n] such that at most ... and PLSE problems are equivalent, i.e., there are value-preserving reductions from PLSE to 3EDM and vice versa.
|Author||:||Wolfgang Thomas, Pascal Weil|
|Publisher||:||Springer Science & Business Media - 2007-02-08|