Automata

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.

This book constitutes the proceedings of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021, held in Milan, Italy, in March 2021.

This book constitutes the refereed proceedings of the 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, which took place in Lodz, Poland, during December 2-4, 2020.

This book gathers selected research papers presented at the First Asian Symposium on Cellular Automata Technology (ASCAT 2022), organized online by academicians from Kolkata, India, during March 3–5, 2022. The book presents one of the most emergent areas in natural computing, cellular automaton (CA). CA is a paradigm of uniform fine-grained parallel computation which has been explored to understand complex systems by developing its model at the microscopic level. The book discusses many real-life problems in the domain of very large-scale integration (VLSI) design and test, pattern recognition and classification, cryptography, pseudo-random pattern generation, image processing, sensor networks, material science, etc., by using CA.

The study of the connections between mathematical automata and for­ mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first­ order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic.

This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence.