This book presents an extensive survey and report of related research on important developments in cellular automata (CA) theory. The authors introduce you to this theory in a comprehensive manner that will help you understand the basics of CA and be prepared for further research. They illustrate the matrix algebraic tools that characterize group CA and help develop its applications in the field of VLSI testing. The text examines schemes based on easily testable FSM, bit-error correcting code, byte error correcting code, and characterization of 2D cellular automata. In addition, it looks into CA-based universal pattern generation, data encryption, and synthesis of easily testable combinational logic. The book covers new characterizations of group CA behavior, CA-based tools for fault diagnosis, and a wide variety of applications to solve real-life problems.
This book reflects more than three decades of research on Cellular Automata (CA), and nearly a decade of work on the application of CA to model biological strings, which forms the foundation of 'A New Kind of Computational Biology' pioneered by the start-up, CARLBio. After a brief introduction on Cellular Automata (CA) theory and functional biology, it reports on the modeling of basic biological strings with CA, starting with the basic nucleotides leading to codon and anti-codon CA models. It derives a more involved CA model of DNA, RNA, the entire translation process for amino acid formation and the evolution of protein to its unique structure and function. In subsequent chapters the interaction of Proteins with other bio-molecules is also modeled. The only prior knowledge assumed necessary is an undergraduate knowledge of computer programming and biology. The book adopts a hands-on, “do-it-yourself” approach to enable readers to apply the method provided to derive the CA rules and comprehend how these are related to the physical ‘rules’ observed in biology. In a single framework, the authors have presented two branches of science – Computation and Biology. Instead of rigorous molecular dynamics modeling, which the authors describe as a Bottoms-Up model, or relying on the Top-Down new age Artificial Intelligence (AI) and Machine Language (ML) that depends on extensive availability of quality data, this book takes the best from both the Top-Down and Bottoms-up approaches and establishes how the behavior of complex molecules is represented in CA. The CA rules are derived from the basic knowledge of molecular interaction and construction observed in biological world but mapped to a few subset of known results to derive and predict results. This book is useful for students, researchers and industry practitioners who want to explore modeling and simulation of the physical world complex systems from a different perspective. It raises the inevitable the question – ‘Are life and the universe nothing but a collection of continuous systems processing information’.
This book presents an extensive survey and report of related research on important developments in cellular automata (CA) theory. The authors introduce you to this theory in a comprehensive manner that will help you understand the basics of CA and be prepared for further research. They illustrate the matrix algebraic tools that characterize group CA and help develop its applications in the field of VLSI testing. The text examines schemes based on easily testable FSM, bit-error correcting code, byte error correcting code, and characterization of 2D cellular automata. In addition, it looks into CA-based universal pattern generation, data encryption, and synthesis of easily testable combinational logic. The book covers new characterizations of group CA behavior, CA-based tools for fault diagnosis, and a wide variety of applications to solve real-life problems.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.