The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters,...

This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of 2004.The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. Among the topics addressed are programming theory, programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics.