What is the complement of the language accepted by the NFA shown below?
Assume ∑ = {a} and ϵ is the empty string

Question

Question

This question was previously asked in

GATE CS 2012 Official Paper

Attempt in App

Answer 1

The correct answer is "option 2".

EXPLANATION:

NFA is:

Consider, ∑ = {a} and ϵ is the empty string

The ∑ = {a} and the NFA accept the following strings:

{a, aa, aaa, aaaa,……}

That means, the language accepted by the regular expression is {a⁺}

Therefore, the complement of the language is:

= {a* - a⁺}

= ϵ

Hence, the correct answer is "option 2".

Download Solution PDF