ExamCompetition Your Success, Our Mission
Login Register
Question discussion

A deterministic finite automaton (DFA) is defined as a 5-tuple (Q, Σ, δ, q0, F). Which of the following is NOT a component of this tuple?

2584Medium DSSSB TGT Computer Science 0 replies 2 views
0

A deterministic finite automaton (DFA) is defined as a 5-tuple (Q, Σ, δ, q0, F). Which of the following is NOT a component of this tuple?

  • AThe set of final (accepting) states
  • BThe stack alphabet
  • CThe transition function
  • DThe input alphabet
Correct answer: B

Explanation

A DFA consists of a finite set of states, an input alphabet, a transition function, a start state and a set of final states; a stack alphabet belongs to pushdown automata, not to a DFA.
Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!