Register

dfa for wxwR , w,x belong to (a+b)^+

1,913 views

2 Answers

Best answer
4 4 votes

a(a+b)+a(a+b)+ + b(a+b)+b(a+b)+ 

= (a(a+b)+a +b(a+b)+b)(a+b)+

Here is NFA for it

And equivalent Minimal DFA is 

having 7 states

• selected by
Voting & Accepting an answer helps improve the community
← Previous · VARIANCENext → · For example, if C is...
← Previous in category · What is the language...Next in category → · Number of DFA ?
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
7.1k
7.1k views
Don't you worry asked Jun 11, 2016
7,081 views
construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .
5 5 votes
1 1 answer
2.5k
2.5k views
Anshul Khantwal asked Jan 30, 2016
2,486 views
Whether w wr x where w,x belongs to {a,b}* Regular?
$L = \{ww_rx, \text{ where } w,x \in \{a,b\}^*\}$ is definitely regular $w$ can always be considered to be empty string $(\epsilon).$ So, this just becomes $(a+b)^*$ lang...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Aditi_Pal asked Jan 21, 2025
1,155 views
Give the DFA for the language L = (ab^5wb^4: w belongs to (a,b)^*)
Give the DFA for the language L = (ab^5wb^4: w belongs to (a,b)^*)
0 0 votes
1 1 answer
263
263 views
mohamed_bahgat asked Jun 3, 2025
263 views
Given Language: L = { a b ∪ a b a } ∗ L={ab∪aba} ∗ Problem Statement: If X X is the minimum number of states required for a DFA to accept L L, and Y Y is the number of states required for an NFA to accept L L, then what is ∣ X − Y ∣ ∣X−Y∣? Multiple Choice Answers: a) 1 b) 2 c) 3 d) 4