02895nam a2200277 i 4500003000500000005001700005008004100022020001800063040002500081050002100106082002000127245003700147250001700184264003800201300004500239336002100284337002500305338002300330504005100353505016000404520195100564650003502515650002702550650002102577710001902598CSPC20260114101627.0260112s2023    nyua     b    001 0 eng d  a9781984680051  aCSPCbengcCSPCerda 4aQA267b.I58 202304a004.0151bIn89100aIntroduction to computer theory.  a2nd edition. 1aNew York :b3G E-Learning,c2023.  axi, 256 pages :billustrations ;c25 cm.  2rdacontentatext  2rdamediaaunmediated  2rdacarrieravolume  aIncludes bibliographical references and index.0 aComputer fundamentals -- Finite automata -- Pushdown automata theory -- Turing machines -- Algorithms -- Distributed computing -- Computational complexity.  a"Theory of Computation or Theory of Automata is the core area of computer science and engineering. It is the branch that aims to try the deep understanding of computational processes by effectively solving the problems with mathematical models, tools and techniques. This understanding is important for its applications, which span various computational models such as algorithms, compilers, and VLSI design to the creation of intelligent technology, cognitive psychology, and philosophy. Automata enables scientists to understand how machines compute functions and solve problems. The main motivation behind the development of automata theory was the development of methods for describing and analyzing the dynamic behavior of discrete systems. To conduct a thorough computational study, computer scientist's work with a mathematical abstraction of computers called a computational model. Several models are used, but the most studied is the Turing machine. Computer scientists study the Turing machine because it is easy to formulate, can be analyzed and used to prove results, and because it represents what many consider to be the most powerful possible reasonable computational model. It may seem that the potentially infinite memory capacity is an unrealizable attribute, but any decidable problem solved by a Turing machine always requires a finite amount of memory. So, in principle, any problem that can be solved by a Turing machine can be solved by a computer that has a finite amount of memory. 
The content coverage in this edition is organized into seven chapters. This edition is completely revised and new The content coverage in this edition is organized into seven chapters. This edition is completely revised and new topics are added. The book addresses the fundamental questions about the nature of computation while at the same time helping we better understand the ways in which we interact with the computer." -- Back cover 0aComputer sciencexMathematics. 0aTheory of computation. 0aAutomata theory.1 a3G E-Learning.