Andere Kunden interessierten sich auch für
![Small Universal Cellular Automata in Hyperbolic Spaces]( "Small Universal Cellular Automata in Hyperbolic Spaces")
Small Universal Cellular Automata in Hyperbolic Spaces110,99 €![Sequences, Groups, and Number Theory]( "Sequences, Groups, and Number Theory")
Sequences, Groups, and Number Theory133,99 €![Phase Locking in Coupled Oscillators as Hybrid Automata]( "Phase Locking in Coupled Oscillators as Hybrid Automata")
Phase Locking in Coupled Oscillators as Hybrid Automata51,99 €![Cellular automata for the analysis of cancer invasion]( "Cellular automata for the analysis of cancer invasion")
Cellular automata for the analysis of cancer invasion51,99 €![Fundamentals of Computation Theory]( "Fundamentals of Computation Theory")
Fundamentals of Computation Theory37,99 €![Logical Methods]( "Logical Methods")
Logical Methods115,99 €![LATIN 2014: Theoretical Informatics]( "LATIN 2014: Theoretical Informatics")
LATIN 2014: Theoretical Informatics38,99 €
In theoretical computer science, automata theory is the study of abstract machines and problems which they are able to solve. Automata theory is closely related to formal language theory as the automata are often classified by the class of formal languages they are able to recognize.An automaton is a mathematical model for a finite state machine . A FSM is a machine that, given an input of symbols, "jumps", or transitions, through a series of states according to a transition function. In the common "Mealy" variety of FSMs, this transition function tells the automaton which state to go to next given a current state and a current symbol.