際際滷

際際滷Share a Scribd company logo

Dfa ii

D
Dr. ABHISHEK K PANDEY

This document discusses deterministic finite automata (DFA). A DFA is a deterministic finite machine where for each input symbol, the next state can be deterministically determined from the current state. It has a finite number of states, so it is called a deterministic finite automaton.

1 of 6
Prof.Neeraj Bhargava Abhishek Kumar Department of Computer Science School of Engineering & System Sciences, MDS, University Ajmer, Rajasthan, India 1
DFA, for each input symbol, one can determine the state to which the machine will move. Hence, it is called Deterministic Automaton. As it has a finite number of states, the machine is called Deterministic Finite Machine or Deterministic Finite Automaton. 2
3
4
5
6

More Related Content

Dfa ii

  • 1. Prof.Neeraj Bhargava Abhishek Kumar Department of Computer Science School of Engineering & System Sciences, MDS, University Ajmer, Rajasthan, India 1
  • 2. DFA, for each input symbol, one can determine the state to which the machine will move. Hence, it is called Deterministic Automaton. As it has a finite number of states, the machine is called Deterministic Finite Machine or Deterministic Finite Automaton. 2
  • 3. 3
  • 4. 4
  • 5. 5
  • 6. 6