The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata Theory,” awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology. "...the thesis of Michał Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas.” Thomas Colcombet.

The book is addressed to young people interested in computer technologies and computer science. The objective of this book is to provide the reader with all the necessary elements to get him or her started in the modern field of informatics and to allow him or her to become aware of the relationship between key areas of computer science. The book is addressed not only to future software developers, but also to all who are interested in computing in a widely understood sense. The authors also expect that some computer professionals will want to review this book to lift themselves above the daily grind and to embrace the excellence of the whole field of computer science. Unlike existing books, this one bypasses issues concerning the construction of computers and focuses only on information processing. Recognizing the importance of the human factor in information processing, the authors intend to present the theoretical foundations of computer science, software development rules, and some business aspects of informatics in non-technocratic, humanistic terms.

This book constitutes the thoroughly refereed papers of the 17th International Conference on Implementation and Application of Automata, CIAA 2012, held in Porto, Portugal, in July 2012. The 21 revised full papers presented together with 5 invited papers and 7 short papers were carefully selected from 53 submissions. The papers cover various topics such as automata applications in formal verification methods, natural language processing, pattern matching, data storage and retrieval, and bioinformatics, as well as theoretical work on automata theory.

Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.

Foundations of Mathematical Biology, Volume II: Cellular Systems describes the properties of cellular systems and their relationship to the development of multicellular organisms. This volume is composed of five chapters that present the mathematical tools applied in evaluating these systems. Chapters 1 illustrates the use of continuous time systems to examine the relationship between the properties of individual cells and the general problems of morphogenesis in developing systems, specifically how these properties could manifest themselves in morphological terms. Chapter 2 demonstrates the systems of rate equations or first-order differential equations to deal with the regulation of individual chemical processes and sequences of such processes, at both the genetic and metabolic levels. Chapter 3 discusses the application of the theory of automata to the evaluation of the concept and principles of embryology, while Chapter 4 presents some relational cell models to study the metabolism-repair cellular systems. Chapter 5 looks into the concept and systems of a compartment. This book will prove useful to mathematical and cell biologists and researchers.

The biannual Formal Methods in Computer Aided Design conference (FMCAD 2000)is the third in a series of conferences under that title devoted to the use of discrete mathematical methods for the analysis of computer hardware and so- ware. The work reported in this book describes the use of modeling languages and their associated automated analysis tools to specify and verify computing systems. Functional veric ation has become one of the principal costs in a modern computer design e ort. In addition,verica tion of circuit models, timing,power, etc., requires even more eo rt. FMCAD provides a venue for academic and - dustrial researchers and practitioners to share their ideas and experiences of using discrete mathematical modeling and veric ation. It is noted with interest by the conference chairmen how this area has grown from just a few people 15 years ago to a vibrant area of research, development, and deployment. It is clear that these methods are helping reduce the cost of designing computing systems. As an example of this potential cost reduction, we have invited David Russino of Advanced Micro Devices, Inc. to describe his veric ation of ?oating-point - gorithms being used in AMD microprocessors. The program includes 30 regular presentations selected from 63 submitted papers.

Formal Description Techniques and Protocol Specification, Testing and Verification addresses formal description techniques (FDTs) applicable to distributed systems and communication protocols. It aims to present the state of the art in theory, application, tools and industrialization of FDTs. Among the important features presented are: FDT-based system and protocol engineering; FDT-application to distributed systems; Protocol engineering; Practical experience and case studies. Formal Description Techniques and Protocol Specification, Testing and Verification comprises the proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification, sponsored by the International Federation for Information Processing, held in November 1998, Paris, France. Formal Description Techniques and Protocol Specification, Testing and Verification is suitable as a secondary text for a graduate-level course on Distributed Systems or Communications, and as a reference for researchers and practitioners in industry.