IndexIntroductionInformal descriptionHow does it work?IntroductionIn the science of theoretical computing, automata theory is the study of mathematical objects called abstract machines or computer robots and problems that can be solved using them. Robot comes from the Greek word a?t?μata which means “self-actuating”. Say no to plagiarism. Get a tailor-made essay on "Why Violent Video Games Shouldn't Be Banned"? Get an original essay Automata theory is also closely related to formal language theory. A robot is a finite representation of a formal language that can be an infinite set. Robots are often classified according to the class of formal languages ​​they can recognize. The following is an introductory definition of a type of robot, which attempts to help us grasp the essential concepts implicit in the theory of automata. Informal Description It is assumed that a robot must execute a certain sequence of inputs in discrete steps of time. In each step of time, a robot gets an input that collects a set of letters or symbols, called an alphabet. At any moment, the symbols entered into the robot so far form a finite sequence of symbols, called a word. A robot contains a finite set of states. In any case, at the time of some execution, the robot is in one of its states. In each time step where the robot reads a symbol, it jumps or travels to a next state which is decided by a function which currently takes the current state and the read symbol as parameters. This function is called the transition function. The robot reads the symbols of the input word one after another and travels from state to state in accordance with the transition function, until the word is read completely. Once the input word is read, the robot is said to be paused, and the state in which the robot is paused is called the final state. After the final state, he himself says that the robot accepts or rejects an input word. There is a subgroup of robot states, which is defined as the set of acceptance states. If the final state is an accepting state, the robot accepts the word. Otherwise the word is rejected. The set of all words accepted by a robot names the language recognized by the robot. In summary, a robot is a mathematical object that takes a word as input and decides to accept or reject it. Since all computer problems are reducible to the accept/reject question of words (all problem instances can be imagined in a finite length of symbols), automata theory plays a crucial role in computer theory. How does it work? the robot is formally represented by a 5-tuple (Q, S, d, q0, F), where:Q is a finite set of states.S is a finite set of symbols, called the robot's alphabet.d is the function of transition, i.e. d: Q × S ? Q.q0 is the start state, i.e. the state of the robot before processing any input, where q0 ? QF is a set of states of Q (i.e. F ? Q) called acceptance states. A robot reads a finite chain of symbols a1, a2,…., an, where ai ? Yes, that is called the entry word. The set of all words is denoted by S *. execute A sequence of states q0, q1, q2,…., qn, where qi ? Q as q0 is the starting state and qi = d (qi-1, ai) for 0 Remember: this is just an example. Get a custom article from our expert writers now. Get a custom essay Recognizable languages ​​are the set of languages ​​recognized by a robot. By the previous definition of robots, the recognizable languages ​​are the regular languages. For definitions other than robots, the recognizable languages ​​are different.