Then, obviously, these arrows with alphabets on them represent the transitions from one state to the next, and it will transit only when the currently inputting part hits on these alphabets. The first circle represents a start state because there is an empty arrow pointing it, and the second one with double circles represents the accept state. There are mainly two components, the circles and the arrows with alphabets on them. To understand this figure, we need some definitions on these notations. The figure is called the state diagram of it. Here is a simple Finite Automata M1 which recognizes all strings on 0,1 ending up with a 1. Teaching Materials in the course of System Programming - Zili Shao.įinite Automata is math model to make decision according to the terminal states which can be approached by reading the input strings and consequently making transitions of the states according to both the current state and input.Introduction to the theory of computation -Michael.This article is a review of my learning process and my ideas during the implementation practice of a simple Lexical Analyzer applying the Finite Automata. Nowadays, though computers are much more complicated and powerful, Finite Automata still lies the heart of many electromechanical devices. Among all of the computational models, Finite Automata is the simplest one, however, it plays an important role in the development of computers.