in Theory of Computation recategorized by
2,773 views
0 votes
0 votes
someone can help me found the regular expression of

L={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1}

 

tnx.
in Theory of Computation recategorized by
by
2.8k views

3 Comments

can you write your language clearly, i didn't understood your language,

you may enumerate the strings of your language.
0
0
i need to find the regular expression of all the a,b that with give me mod 3 = 1

like : 1,4,7,10,,,,,,,,

(a+b) + (bb + aa)(ab+ba).....
0
0

then check (a+b).[ (a+b).(a+b).(a+b)]*

1
1

1 Answer

0 votes
0 votes
look its always better that you should form the automata first then reduce it to the regex.

further as pointed out the regex will be  { ( a+b) (a+b) (a+b) }* (a+b)

1 comment

thank you both all good
0
0