This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). The figure at right illustrates a finite-state machine, which belongs to a well-known type of automaton. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite-State Machine (FSM). An automaton (Automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. The word automata (the plural of automaton) comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". It is a theory in theoretical computer science. Since all paths from S 1 to itself contain an even number of arrows marked 0, this automaton accepts strings containing even numbers of 0s.Īutomata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them.
The double circle marks S 1 as an accepting state. The automaton described by this state diagram starts in state S 1, and changes states following the arrows marked 0 or 1 according to the input symbols as they arrive.
0 kommentar(er)
