Register

TOC: No of states in Equvalent NFA

1,569 views
1 votes
1 votes

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

User Avatar

2 Answers

Best answer
4 votes
4 votes

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

• edited by
User Avatar
1 votes
1 votes
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
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
rahul sharma 5 asked Aug 4, 2017
1,350 views
Number of Final states in minimal FA(NFA)
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
What will be total number of final states in NFA for the given regular expression?$R=(a+b)^{*}b(a+b+\epsilon )$
User Avatar
0 votes
0 votes
1 answer
2
reena_kandari asked Jun 20, 2017
2,403 views
Total number of states in NFA
How many NFA with exactly four states can be constructed over the alphabet S= {a, b} with designated initial state?
How many NFA with exactly four states can be constructed over the alphabet S= {a, b} withdesignated initial state?
User Avatar
10 votes
10 votes
1 answer
4
wxyz asked Jan 4, 2016
11,973 views
can we find out minimum numbers of states in DFA if NFA has n states
User Avatar
Link Copied!