Choose an application

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

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

• 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)

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

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

"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

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

This book discusses Moore finite state machines (FSMs) implemented with field programmable gate arrays (FPGAs) including look-up table (LUT) elements and embedded memory blocks (EMBs). To minimize the number of LUTs in FSM logic circuits, the authors propose replacing a state register with a state counter. They also put forward an approach allowing linear chains of states to be created, which simplifies the system of input memory functions and, therefore, decreases the number of LUTs in the resulting FSM circuit. The authors combine this approach with using EMBs to implement the system of output functions (microoperations). This allows a significant decrease in the number of LUTs, as well as eliminating a lot of interconnections in the FSM logic circuit. As a rule, it also reduces the area occupied by the circuit and diminishes the resulting power dissipation. This book is an interesting and valuable resource for students and postgraduates in the area of computer science, as well as for designers of digital systems that included complex control units.

Engineering. --- Computational intelligence. --- Electronic circuits. --- Computational Intelligence. --- Circuits and Systems. --- Electron-tube circuits --- Intelligence, Computational --- Construction --- Electric circuits --- Electron tubes --- Electronics --- Artificial intelligence --- Soft computing --- Industrial arts --- Technology --- Systems engineering. --- Engineering systems --- System engineering --- Engineering --- Industrial engineering --- System analysis --- Design and construction --- Sequential machine theory. --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers