Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE CS Mock 2018 | Set 2 | Question 28

  • Last Updated : 08 Mar, 2018

Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b}
L =  \{ n_a(w) \mod 3 > n_b(w) \mod 3 \mid a > b \}
The number of final state(s) will be
(A) 2
(B) 1
(C) 3
(D) 6


Answer: (C)

Explanation: We have to Check for all the states where a > b. Say &Sigma = { 0, 1, 2 }
Therefore, final states will be = { 10, 20, 21 }
Number of final states will be 3.


Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!