retagged by
1,275 views
2 votes
2 votes

Identify the language accepted by the following NFA with $\in$-moves.

  • All strings over a's and b's
  • All strings which do not contain aa
  • All strings which do not contain bb
  • None of these

----------------------------------------------------------------------------------------------------

Made Easy Q 11, FLT 6- Practice Test 14

Here issue is that this language accepts (a+b)+

So my question is that ->

Do we include empty string in "All strings over a's and b's", to be honest I feel that answer given is incorrect, & IT should have been "All strings over a's and b's". Because empty string is not really a string which we should count over any alphabet. If they have said (a+b)* as first option , it was easy & Clear. But using words instead of precise notation , makes this question confusing. Please answer this question, what should be correct answer.

retagged by

3 Answers

Best answer
5 votes
5 votes
Above FA is accepting all strings over a and b excluding empty string so ans should be D.

[option A, all strings over {a, b}, means all strings starting from length 0, if something not explicitly given]
selected by
0 votes
0 votes
I think option a is correct . because we can form any string of a & b which can be accepted by given NFA , but only epsilon is not accepted . string either end with a or b.

 

option B  and C looks incorrect , becoz there is loop with a and b . it means that it can take any number of a's and b's (aa & bb covered)

(a+b)+    is accepted    but (a+b)* is not accepted , because with epsilon we are not get into final state
0 votes
0 votes
Given answer is correct. It should be 'D', as empty string is not getting accepted.
All the strings over a and b implicitly includes the empty string i.e., {a+b}*

Related questions

1 votes
1 votes
1 answer
1
Mahesha999 asked Dec 25, 2016
1,878 views
Consider the NFA below:The above NFA acceptes all those binary strings which represents the decimal numbers and area. divisible by 6 onlyb. dividible by 2 and 3 onlyc. di...
2 votes
2 votes
1 answer
2
khushtak asked Jan 10, 2016
1,170 views
Accepting language is1- [(1*0)*01*]*0* Or 2- (1*0)*0]*0* any of these is correct??
1 votes
1 votes
1 answer
3
GateAspirant999 asked Mar 2, 2018
1,082 views
Language accepted by following NFA and number of states in DFA accepting that Language are:$\{a^n|n=2k,kϵN\}$ and 2$\{a^{2n}|n=2k,kϵN\}$ and 2$\{a^n|n=2k,kϵ N\}$ and 3...