Register

Not Regular language [find out]

245 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

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Miki_Patel asked Sep 26, 2016
814 views
Peterlinz- find out if lang is regular or not
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ? L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ?L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
User Avatar
0 votes
0 votes
1 answer
3
KiranWatts asked Jan 16, 2017
517 views
#finding out regular expression for given regular language
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
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.T...
User Avatar
Link Copied!