Listing 1 - 10 of 37 | << page >> |
Sort by
|
Choose an application
Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, teleco
Discrete mathematics --- Sequential machine theory. --- Algebra. --- Sequential machine theory --- Mathematics --- Mathematical analysis --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers
Choose an application
Choose an application
Emphasizing structured and rigorous design principles that can be applied to practical applications, Sequential Logic offers a thorough exposition of the analysis and synthesis of both synchronous and asynchronous sequential machines. This book reviews the analysis of combinatorial logic, defines sequential machines, and discusses methods for synthesizing synchronous sequential machines. It also covers the analysis and synthesis of asynchronous sequential machines and pulse-mode asynchronous sequential machines. The author presents basic and advanced concepts in sequential machine analysis and synthesis for practicing electrical and computer engineers, undergraduate, and graduate students.
Sequential machine theory --- Sequential machine theory. --- combinatietheorie --- sequentiele logica --- synchrone machine --- sequentiele machine --- asynchrone machine --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers
Choose an application
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
Categories (Mathematics) --- Sequential machine theory --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Category theory (Mathematics) --- Algebra, Homological --- Algebra, Universal --- Group theory --- Logic, Symbolic and mathematical --- Topology --- Functor theory --- Sequential machine theory. --- Categories (Mathematics).
Choose an application
"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
Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and their generalizations, such as Sturmian words and k-regular sequences. And further, they provide applications to number theory (particularly to formal power series and transcendence in finite characteristic), physics, computer graphics, and music. Starting from first principles wherever feasible, basic results from combinatorics on words, numeration systems, and models of computation are discussed. Thus this book is suitable for graduate students or advanced undergraduates, as well as for mature researchers wishing to know more about this fascinating subject. Results are presented from first principles wherever feasible, and the book is supplemented by a collection of 460 exercises, 85 open problems, and over 1600 citations to the literature.
Automation. --- Mathematics. --- Sequences (Mathematics). --- Sequential machine theory. --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Sequences (Mathematics) --- Mathematical sequences --- Numerical sequences --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers
Choose an application
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
"The Quantum Cellular Automaton (QCA) concept represents an attempt to break away from the traditional three-terminal device paradigm that has dominated digital computation. Since its early formulation in 1993 at Notre Dame University, the QCA idea has received significant attention and several physical implementations have been proposed. This book provides a comprehensive discussion of the simulation approaches and the experimental work that have been undertaken on the fabrication of devices capable of demonstrating the fundamentals of QCA action. Complementary views of future perspectives for QCA technology are presented, highlighting a process of realistic simulation and of targeted experiments that can be assumed as a model for the evaluation of future device proposals."
Cellular automata. --- Sequential machine theory. --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory
Choose an application
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
Listing 1 - 10 of 37 | << page >> |
Sort by
|