Finite state system or finite automata
- 1. Prof.Neeraj Bhargava Abhishek Kumar Department of Computer Science School of Engineering & System Sciences, MDS, University Ajmer, Rajasthan, India
- 3. Definition of Finite Automata Examples Limitations of Finite Automata
- 4. A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.
- 5. A finite automaton consists of: a finite set S of N states a special start state a set of final (or accepting) states a set of transitions T from one state to another, labeled with chars in C
- 6. We can explain each step in this program as follows: 1. Initialization 2. Looking for "m" 3. Recognized "m", looking for "a" 4. Recognized "ma", looking for "i" 5. Recognized "mai", looking for "n" 6. Recognized "main"
- 7. 4-state FA to recognize words with 3 x's 3-state FA to recognize Pascal variable names (letter followed by one or more letters or digits) 4-state FA to recognize binary strings that end with 111
- 8. There is no finite automaton that recognizes these strings: The set of binary strings consisting of an equal number of 1's and 0's The set of strings over '(' and ')' that have "balanced" parentheses
- 9. THANK YOU