You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume brings together the work of several prominent researchers who have collaborated with Janusz Brzozowski, or worked in topics he developed, in the areas of regular languages, syntactic semigroups of formal languages, the dot-depth hierarchy, and formal modeling of circuit testing and software specification using automata theory.
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 commemorative book celebrates the 70th birthday of Arto Kustaa Salomaa, one of the most influential researchers in theoretical computer science. The 24 invited papers by leading researchers in the area address a broad variety of topics in theoretical computer science and impressively reflect the breadth and the depth of Arto Salomaa's scientific work.
The contributors present the main results and techniques of their specialties in an easily accessible way accompanied with many references: historical, hints for complete proofs or solutions to exercises and directions for further research. This volume contains applications which have not appeared in any collection of this type. The book is a general source of information in computation theory, at the undergraduate and research level.
Assertion-based design is a powerful new paradigm that is facilitating quality improvement in electronic design. Assertions are statements used to describe properties of the design (I.e., design intent), that can be included to actively check correctness throughout the design cycle and even the lifecycle of the product. With the appearance of two new languages, PSL and SVA, assertions have already started to improve verification quality and productivity. This is the first book that presents an “under-the-hood” view of generating assertion checkers, and as such provides a unique and consistent perspective on employing assertions in major areas, such as: specification, verification, debugging, on-line monitoring and design quality improvement.
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 proceedings of the 13th International Conference, DLT 2009, held in Stuttgart, Germany from June 30 until July 3, 2009. The 35 papers presented together with 4 invited talks were carefully reviewed and selected from 70 submissions. The papers presented address topics on formal languages, automata theory, computability, complexity, logic, petri nets and related areas.
This volume represents the state of the art for much current research in many-valued logics. Primary researchers in the field are among the authors. Major methodological issues of many-valued logics are treated, as well as applications of many-valued logics to reasoning with fuzzy information. Areas covered include: Algebras of multiple valued logics and their applications, proof theory and automated deduction in multiple valued logics, fuzzy logics and their applications, and multiple valued logics for control theory and rational belief.