Compiler-Design
May 4, 2024Theory-of-Computation
May 4, 2024Finite-Automata
|
Question 4
|
What is the complement of the language accepted by the NFA shown below?
Assume Σ={a} and ε is the empty string.
|
∅
|
|
|
{ε}
|
|
|
a*
|
|
|
{a ,ε}
|
Question 4 Explanation:
The Σ= {a} and the given NFA accepts the strings {a, aa, aaa, aaaa, ……….} i.e. the language accepted by the NFA can be represented by the regular expression: {a+}
Hence the complement of language is: {a* − a+} = {ϵ}
Hence the complement of language is: {a* − a+} = {ϵ}
Correct Answer: B
Question 4 Explanation:
The Σ= {a} and the given NFA accepts the strings {a, aa, aaa, aaaa, ……….} i.e. the language accepted by the NFA can be represented by the regular expression: {a+}
Hence the complement of language is: {a* − a+} = {ϵ}
Hence the complement of language is: {a* − a+} = {ϵ}