[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2008 Volume 5162 || Succinctness of Regular Expressions with Interleaving, Intersection and Counting
✍ Scribed by Ochmański, Edward; Tyszkiewicz, Jerzy
- Book ID
- 111875971
- Publisher
- Springer Berlin Heidelberg
- Year
- 2008
- Tongue
- English
- Weight
- 430 KB
- Edition
- 1
- Category
- Article
- ISBN
- 3540852387
No coin nor oath required. For personal study only.
✦ Synopsis
This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.
📜 SIMILAR VOLUMES
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 A