This book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, theoretical issues in artificial intelligence.A technical analysis allows us to prove a containment in the other direction, but one that is not very tight - showing the difference between the ... We show that if u agt;m+i, 2n or u alt;m+i, 2n, then Properties (WI lc), (WI 2c) and (WI 3c) hold for m, n.
|Title||:||Mathematical Foundations of Computer Science 2009|
|Author||:||Rastislav Královic, Damian Niwinski|
|Publisher||:||Springer Science & Business Media - 2009-08-06|