Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study...

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and each chapter is self contained and peer reviewed.

The first part of the book traces the history of finite fields through the eighteenth and nineteenth centuries. The second part presents theoretical properties of...

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:

• Comparative approaches (graph similarity or distance)
• Graph...

Although sequent calculi constitute an important category of proof systems, they are not as well known as axiomatic and natural deduction systems. Addressing this deficiency, Proof Theory: Sequent Calculi and Related Formalisms presents a comprehensive treatment of sequent calculi, including a wide range of variations. It focuses on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, linear logic, and modal logic.

In the first chapters, the author emphasizes classical logic and a variety of different sequent calculi for classical and...

The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Godel, Church, Kleene, Rosser, and Turing.

The sixth edition incorporates recent work on Godel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition....

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today s most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.
This important new work is edited by Miklos Bona of the University of Florida where he is a member of the Academy of Distinguished Teaching Scholars. He received his Ph.D. in mathematics at Massachusetts Institute of Technology in 1997. Miklos is the author of four books and more than 65 research articles, including the...

The purpose of this undergraduate textbook is to offer all the material suitable for a beginning combinatorics course for students in STEM subjects particularly mathematics and computer science, although other subjects may benefit as well. This will be achieved through the use of plentiful (though brief) examples, and a variety of exercises and problems. In addition, we use in our examples more up-to-date ideas (such as digital music files rather than books on a shelf) and give some code to assist the student with the use of Mathematica, Maple, and other technological tools.

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

The subject is at the crossroads of Discrete Mathematics and Computer Science, with a strong probabilistic flavor. The main tools used before are on the one hand analytic (generating functions and complex analysis), and on the other probabilistic (strong laws, central limit theorems, martingales, etc.) Often, professionals worked with one set of tools or the other. We offer a reconciliation to espouse these fields to come in hand-in-hand offering a harmonious and beneficial marriage.