Question: Find a regular expression for the following regular languages (a) {W : 2na(w) + 3n)(w) is even } (b) {w : (na(w) no(w)) mod 3

Find a regular expression for the following regular languages (a) {W : 2na(w) + 3n)(w) is even } (b) {w : (na(w) no(w)) mod 3 =1} Find a regular expression for the following regular languages (a) {W : 2na(w) + 3n)(w) is even } (b) {w : (na(w) no(w)) mod 3 =1}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
