Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions"--Provided by publisher. "Topics in switching and finite automata theory have been an important part of the curriculum in electrical engineering and computer science departments for several decades. The third edition of this book builds on the comprehensive foundation provided by the second edition and adds: significant new material in the areas of CMOS logic; modern two-level and multi-level logic synthesis methods; logic design for emerging nanotechnologies; test generation, design for testability and built-in self-test for combinational and sequential circuits; modern asynchronous circuit synthesis techniques; etc. We have attempted to maintain the comprehensive nature of the earlier edition in providing readers with an understanding of the structure, behavior, and limitations of logical machines. At the same time, we have provided an up-to-date context in which the presented techniques can find use in a variety of applications.We start with introductory material and build up to more advanced topics. Thus, the technical background assumed on the part of the reader is minimal"--Provided by publisher.

Sequential machine theory. --- Switching theory. --- Automatic control --- Digital electronics --- Electric networks --- Electric switchgear --- Information theory --- Logic, Symbolic and mathematical --- Machine theory --- Mathematical physics --- System analysis --- Telecommunication --- Finite automata --- Finite state machines (Machine theory) --- Electronic digital computers

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Deeply rooted in fundamental research in Mathematics and Computer Science, Cellular Automata (CA) are recognized as an intuitive modeling paradigm for Complex Systems. Already very basic CA, with extremely simple micro dynamics such as the Game of Life, show an almost endless display of complex emergent behavior. Conversely, CA can also be designed to produce a desired emergent behavior, using either theoretical methodologies or evolutionary techniques. Meanwhile, beyond the original realm of applications - Physics, Computer Science, and Mathematics – CA have also become work horses in very different disciplines such as epidemiology, immunology, sociology, and finance. In this context of fast and impressive progress, spurred further by the enormous attraction these topics have on students, this book emerges as a welcome overview of the field for its practitioners, as well as a good starting point for detailed study on the graduate and post-graduate level. The book contains three parts, two major parts on theory and applications, and a smaller part on software. The theory part contains fundamental chapters on how to design and/or apply CA for many different areas. In the applications part a number of representative examples of really using CA in a broad range of disciplines is provided - this part will give the reader a good idea of the real strength of this kind of modeling as well as the incentive to apply CA in their own field of study.

Cellular automata --- Engineering & Applied Sciences --- Mathematics --- Physical Sciences & Mathematics --- Computer Science --- Algebra --- Cellular automata. --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Computer science. --- Computer simulation. --- System theory. --- Computer mathematics. --- Computational intelligence. --- Computer Science. --- Simulation and Modeling. --- Complex Systems. --- Computational Science and Engineering. --- Computational Intelligence. --- Statistical Physics and Dynamical Systems. --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Systems, Theory of --- Systems science --- Science --- Computer modeling --- Computer models --- Modeling, Computer --- Models, Computer --- Simulation, Computer --- Electromechanical analogies --- Mathematical models --- Simulation methods --- Model-integrated computing --- Informatics --- Philosophy --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Engineering. --- Statistical physics. --- Construction --- Industrial arts --- Technology --- Physics --- Mathematical statistics --- Statistical methods --- Dynamical systems. --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Statics --- Mathematical physics. --- Computer Modelling. --- Theoretical, Mathematical and Computational Physics. --- Data processing. --- Physical mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form.

Cellular automata. --- Computational complexity. --- Electronic books. -- local. --- Cellular automata --- Group theory --- Computational complexity --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Calculus --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Complexity, Computational --- Computer science. --- Computer logic. --- Algebra. --- Dynamics. --- Ergodic theory. --- Computer Science. --- Logics and Meanings of Programs. --- Dynamical Systems and Ergodic Theory. --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Mathematical analysis --- Computer science logic --- Logic, Symbolic and mathematical --- Informatics --- Science --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Electronic data processing --- Machine theory --- Logic design. --- Differentiable dynamical systems. --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Group theory.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Introductory MEMS: Fabrication and Applications is a practical introduction to MEMS for advanced undergraduate and graduate students. Part I introduces the student to the most commonly used MEMS fabrication techniques as well as the MEMS devices produced using these techniques. Part II focuses on MEMS transducers: principles of operation, modeling from first principles, and a detailed look at commercialized MEMS devices, in addition to microfluidics. Multiple field-tested laboratory exercises are included, designed to facilitate student learning about the fundamentals of microfabrication processes. References, suggested reading, review questions, and homework problems are provided at the close of each chapter. Introductory MEMS: Fabrication and Applications is an excellent introduction to the subject, with a tested pedagogical structure and an accessible writing style suitable for students at an advanced undergraduate level across academic disciplines. .

Engineering. --- Electronics and Microelectronics, Instrumentation. --- Circuits and Systems. --- Mechanics. --- Surfaces and Interfaces, Thin Films. --- Continuum Mechanics and Mechanics of Materials. --- Materials. --- Electronics. --- Systems engineering. --- Surfaces (Physics). --- Ingénierie --- Mécanique --- Matériaux --- Electronique --- Ingénierie des systèmes --- Surfaces (Physique) --- Microelectromechanical systems. --- Electronic apparatus and appliances. --- Transducers. --- Electronic books. -- local. --- Microelectromechanical systems --- Electronic apparatus and appliances --- Transducers --- Electrical & Computer Engineering --- Engineering & Applied Sciences --- Electrical Engineering --- Electronic devices --- Electronics --- MEMS (Microelectromechanical systems) --- Micro-electro-mechanical systems --- Micro-machinery --- Microelectromechanical devices --- Micromachinery --- Micromachines --- Micromechanical devices --- Micromechanical systems --- Apparatus and appliances --- 681.3*A0 --- 681.3*D31 --- 681.3*F12 --- Formal definitions and theory: semantics syntax (Programming languages)--See also {681.3*D21} {681.3*F31} {681.3*F32} {681.3*F42} {681.3*F43} --- Process management: concurrency deadlocks multiprocessing/multiprogrammingmutual exclusion scheduling synchronization (Operating systems) --- Modes of computation: alternation and nondeterminism parallelism probabilistic computation relations among modes relativized computation --- 681.3*F12 Modes of computation: alternation and nondeterminism parallelism probabilistic computation relations among modes relativized computation --- 681.3*D41 Process management: concurrency deadlocks multiprocessing/multiprogrammingmutual exclusion scheduling synchronization (Operating systems) --- 681.3*D31 Formal definitions and theory: semantics syntax (Programming languages)--See also {681.3*D21} {681.3*F31} {681.3*F32} {681.3*F42} {681.3*F43} --- Sequential Machine Theory --- FORMAL LANGUAGES --- Continuum mechanics. --- Microelectronics. --- Electronic circuits. --- Materials --- Thin films. --- Surfaces. --- Programming --- Computer science --- #TCPW P4.0 --- #TCPW P4.6 --- 681.3*D41 --- 681.3*F3 --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- Logics and meanings of programs (Theory of computation) --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3*D41 Process management: concurrency; deadlocks; multiprocessing/multiprogramming;mutual exclusion; scheduling; synchronization (Operating systems) --- Process management: concurrency; deadlocks; multiprocessing/multiprogramming;mutual exclusion; scheduling; synchronization (Operating systems) --- 681.3*A0 General --- General --- 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- 681.3*F0 --- 681.3*F4 --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- Mathematical logic and formal languages (Theory of computation) --- Computerwetenschap--?*F0 --- Electric apparatus and appliances --- Electromechanical devices --- Physical instruments --- Scientific apparatus and instruments --- Electronic instruments --- Microtechnology --- Mechatronics --- Parallel processing (Electronic computers) --- Programming languages (Electronic computers) --- Congresses --- Semantics --- Parallélisme (Informatique) --- Langages de programmation --- Congrès --- Sémantique --- Mechanics, Applied. --- Classical Mechanics. --- Solid Mechanics. --- Applied mechanics --- Engineering, Mechanical --- Engineering mathematics --- Physics --- Surface chemistry --- Surfaces (Technology) --- Classical mechanics --- Newtonian mechanics --- Dynamics --- Quantum theory --- Engineering systems --- System engineering --- Engineering --- Industrial engineering --- System analysis --- Electrical engineering --- Physical sciences --- Design and construction --- Materials—Surfaces. --- Films, Thin --- Solid film --- Solid state electronics --- Solids --- Coatings --- Thick films --- Microminiature electronic equipment --- Microminiaturization (Electronics) --- Semiconductors --- Miniature electronic equipment --- Electron-tube circuits --- Electric circuits --- Electron tubes --- Logic design. --- Software engineering. --- Logics and Meanings of Programs. --- Software Engineering. --- Information theory. --- Theory of Computation. --- Software Engineering/Programming and Operating Systems. --- Computer software engineering --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Communication theory --- Communication --- Cybernetics --- Logique --- Programmation système (informatique) --- Parallel processing (Electronic computers) - Congresses --- Programming languages (Electronic computers) - Semantics - Congresses --- Sequential Machine Theory - Congresses --- FORMAL LANGUAGES - Congresses --- Programming languages (Electronic computers) - Congresses --- Langages de programmation.