Table of contentsIntroductionInformal descriptionHow does it work?IntroductionIn the science of theoretical computation, automata theory is the study of mathematical objects called abstract machines or the computer robots and problems that can be solved using them. Robot comes from the Greek word a?t?µata which means “self-acting”. Say no to plagiarism. Get a tailor-made essay on “Why Violent Video Games Should Not Be Banned”? Get an original essay The theory of automata is also closely related to the theory of formal language. A robot is a finite representation of a formal language which can be an infinite set. Robots are often classified according to the class of formal languages ​​capable of recognition. The following is an introductory definition of a type of robot, which attempts to help us grasp the essential concepts implicit in automata theory. Informal description It is assumed that a robot must execute in a certain sequence of inputs in discrete time passages. With each passage of time, a robot obtains an input that retrieves a set of letters or symbols, called an alphabet. At any time, the symbols introduced so far by the robot form a finite sequence of symbols, which we call a word. A robot contains a finite set of states. In each case, at the time of an execution, the robot is in one of its states. At each passage of time, when the robot reads a symbol, it jumps or moves to a next state which is decided by a function which currently takes the current state and the symbol is read as parameters. This function is called 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, it indicates that the robot is paused and the state in which the robot has stopped is called final state. Following the final state, the robot is said to accept or reject 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 acceptance state, then the robot accepts the word. Otherwise, the word is rejected. The set of all words accepted by a robot names a language recognized by the robot. In summary, a robot is a mathematical object that takes a word as it is input and decides whether to accept or reject it. Since all computer problems are reducible to the question of accepting/rejecting 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-tupla (Q, S, d, q0, F), where: Q is a finite set of states. S is a finite set of symbols, called the robot alphabet. d is the transition function, 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 string of symbols a1, a2,…., an, where ai? S is what we call an entry word. The set of all words is denoted S*. execute A sequence of states q0, q1, q2,…., qn, where qi? Q as q0 is the start state and qi = d (qi-1, ai) for 0 Keep in mind: this is just a sample. Get a personalized article from our expert writers now. Get a Custom Essay Recognizable languages ​​are the set of languages ​​that a robot recognizes. For the previous definition of robots, the recognizable languages ​​are regular languages. For different definitions of robot, recognizable languages.