Choose an application

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

Sequential machine theory --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Sequential machine theory. --- Automates abstraits --- Automates finis

Choose an application

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

Modeling Software with Finite State Machines: A Practical Approach explains how to apply finite state machines to software development. It provides a critical analysis of using finite state machines as a foundation for executable specifications to reduce software development effort and improve quality. It discusses the design of a state machine and of a system of state machines. It also presents a detailed analysis of development issues relating to behavior modeling with design examples and design rules for using finite state machines. This text demonstrates the implementation of these concepts using StateWORKS software and introduces the basic components of this software.

software machinebouw --- fsm --- embedded system --- programmeren --- Computer software --- Machine theory. --- Development. --- Sequential machine theory --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Development of computer software --- Software development --- Development

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)

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.

Computable functions. --- Computational complexity. --- Sequential machine theory. --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Complexity, Computational --- Electronic data processing --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic)

Choose an application

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

Automata, languages, and machines

Computer science --- Sequential machine theory --- Formal languages --- Théorie des machines séquentielles --- Langages formels --- ELSEVIER-B EPUB-LIV-FT --- Formal languages. --- Sequential machine theory. --- Automata --- Machine theory. --- Abstract automata --- Abstract machines --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- 519.713 --- 519.713 Automata --- Automates abstraits --- Automates finis