# 2.dfa.pdf

21 de Mar de 2023

### 2.dfa.pdf

1. •Automaton refers to Automation •A system where energy and information are transferred and used for performing function without human involvement called Automaton •Automaton is nothing but a machine which accepts the strings of a language L over an input alphabet Σ. •There are four different types of Automata that are mostly used in the theory of computation (TOC). These are as follows − 1. Finite-state machine (FSM). 2. Pushdown automata (PDA). 3. Linear-bounded automata (LBA). 4. Turing machine (TM). Prof.S.R.Pawar
2. Finite Automata Finite automata are used to recognize patterns. It takes the string of symbol as input and changes its state accordingly. When the desired symbol is found, then the transition occurs. At the time of transition, the automata can either move to the next state or stay in the same state. Finite automata have two states, Accept state or Reject state. When the input string is processed successfully, and the automata reached its final state, then it will accept Prof.S.R.Pawar
3. Applications of Finite Automata (FA) The applications of Finite Automata are as follows − •Design of the lexical analysis of a compiler. •Recognize the pattern by using regular expressions. •Use of the Mealy and Moore Machines for designing the combination and sequential circuits. •Helpful in text editors. •Used for spell checkers. Prof.S.R.Pawar
4. Finite Automata Model: Finite automata can be represented by input tape and finite control. Input tape: It is a linear tape having some number of cells. Each input symbol is placed in each cell. Finite control: The finite control decides the next state on receiving particular input from input tape. The tape reader reads the cells one by one from left to right, and at a time only one input symbol is read. Prof.S.R.Pawar
5. Prof.S.R.Pawar
6. Types of Automata: There are two types of finite automata: 1.DFA(deterministic finite automata) 2.NFA(non-deterministic finite automata) Prof.S.R.Pawar
7. Prof.S.R.Pawar
8. Prof.S.R.Pawar
9. Prof.S.R.Pawar
10. Prof.S.R.Pawar
11. Prof.S.R.Pawar
12. Prof.S.R.Pawar
13. Prof.S.R.Pawar
14. Prof.S.R.Pawar
15. Prof.S.R.Pawar
16. Prof.S.R.Pawar
17. Prof.S.R.Pawar
18. Prof.S.R.Pawar
19. Prof.S.R.Pawar
20. Prof.S.R.Pawar
21. Prof.S.R.Pawar
22. Prof.S.R.Pawar
23. Prof.S.R.Pawar
24. 1. Design FA which accepts only those strings which starts with 1 and ends with 0 2. Design FA which accepts only 100 or 10 3. Design FA which accepts only those strings which starts and ends with 1 Prof.S.R.Pawar
25. Prof.S.R.Pawar