This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis.The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more.

This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity.

This book constitutes the refereed proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2019, held in Novy Smokovec, Slovakia, in January 2019. The 34 full papers presented together with 6 invited talks were carefully reviewed and selected from 92 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2019: Foundations of theoretical Computer Science, foundations of data science and engineering, and foundations of software engineering.