1 votes 1 votes Give regular expressions for the following languages on $Σ =$ {$a, b, c$}. (a) all strings containing exactly one $a$, (b) all strings containing no more than three $a$’s, (c) Peter Linz Edition 4 Exercise 3.1 Question 16.c (Page No. 76) (d)Peter Linz Edition 4 Exercise 3.1 Question 16.d (Page No. 76) (e) all strings in which all runs of $a$'shave lengths that are multiples of three. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression + – Naveen Kumar 3 asked Mar 31, 2019 Naveen Kumar 3 1.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes a. (b+c)*a(b+c)* b. (b+c)*(ε+a)(b+c)*(ε+a)(b+c)*(ε+a)(b+c)* e. (aaa+b)* aditi19 answered Jun 7, 2020 • edited Jun 7, 2020 by aditi19 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.