GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 28

Consider the following non-deterministic finite automaton (NFA) over the alphabet Σ = {0, 1}.

Language of the above NFA is
(A) (2n + 1) mod 5
(B) (n + 1) mod 5
(C) (n) mod 5
(D) (2n) mod 5


Answer: (A)

Explanation: (2n + 1) mod 5 = (2n mod 5 + 1) mod 5

Option (A) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.