Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.
Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject.
Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem.
This monograph is based on a series of lectures given by the author at the first Advanced Research Institute on Discrete Applied Mathematics, held at Rutgers University.
Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance.
This textbook offers a geometric perspective on special relativity, bridging Euclidean space, hyperbolic space, and Einstein's spacetime in one accessible, self-contained volume.
This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations.
ACMES (Algorithms and Complexity in Mathematics, Epistemology, and Science) is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science.
Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata.
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling.
In this book we generate graphic images using the software Mathematica thus providing a gentle and enjoyable introduction to this rather technical software and its graphic capabilities.
As the sophistication of cyber-attacks increases, understanding how to defend critical infrastructure systems-energy production, water, gas, and other vital systems-becomes more important, and heavily mandated.
This book comes out of need and urgency (expressed especially in areas of Information Retrieval with respect to Image, Audio, Internet and Biology) to have a working tool to compare data.
This unique textbook comprehensively introduces the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds.
Recursion: Mathematics and Python is designed to help readers develop a clear and systematic understanding of recursion as both a mathematical concept and a programming technique.
Recursion: Mathematics and Python is designed to help readers develop a clear and systematic understanding of recursion as both a mathematical concept and a programming technique.