TOC: No of states in Equvalent NFA

Question

Consider the following language.
                                                          L = {wxwy | x,y,w∈(a+b)⁺}
How many states are there in equivalent NFA for above L?

Comments

answer?

---

What is the answer 7 states in the equivalent NFA?

---

7 or 8 both are correct. but my question is not to how many state  i am asking how to write a regular expression for a given language.

Answer 1

Regular expression for the language is $a(a+b)^+a(a+b)^+ +b(a+b)^+b(a+b)^+$

NFA will be as 

Or 

For Reference :

https://gateoverflow.in/32989/why-this-is-not-a-regular-language

Comments

sir how to get RE from this language " L = {wxwy | x,y,w∈(a+b)+}" ?

---

i think regular expression should be
(  a(a+b)+a(a+b)+  +  b(a+b)+b(a+b)+  )
please correct me if wrong.

---

No!. (  a(a+b)+a(a+b)+  +  b(a+b)+b(a+b)+  )

 But how to generate this ?

---

Yes it will be $a(a+b)^+a(a+b)^+ + b(a+b)^+b(a+b)^+$

corrected

---

Is the lang regular? don't we need to match w?

---

https://gateoverflow.in/32989/why-this-is-not-a-regular-language

---

thank you for correcting me

Answer 2

NFA doesnt exist.

its not even context free.

the NFA given is wrong .since it will accept string that are not in the language.

remeber,if string is not in langugae then NFA will reject it.

but if its in languga atleast one path will be present to final state