259 views

1 Answer

0 votes
0 votes

C) It is actually starting with 2 same symbols and ending with their reverse 



you can easily make NFA using Binary Tree like structure



here is Regular Expression for the same :



aa Σ* aa + ab Σ* ba + bb Σ* bb + ba Σ* ab

Related questions

254
views
0 answers
0 votes
M_Umair_Khan42900 asked Dec 29, 2022
254 views
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular.a) ( ... 9) with characters in sorted orders.c) The set of all even binary numbers
828
views
1 answers
1 votes
Miki_Patel asked Sep 26, 2016
828 views
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ?L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
554
views
1 answers
0 votes
KiranWatts asked Jan 16, 2017
554 views
I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume.Thanks & Regards,Kiran Watts
1.4k
views
3 answers
7 votes
Garrett McClure asked Sep 22, 2017
1,426 views
Find regular expressions for:All binary strings with exactly two $1's$The set $\{a^nb^m :n\geq3, m$ is even$\}$All binary strings with a double symbol (contains $00$ or $11$) ... .The language on $\Sigma=\{a,b\}, L=\{w:n_a(w) \mod 3=0\}$