Formal languages (regular expression and context free languages)?

A

New member
Is it possible to have a regular expression that has at least 4 occurrences of a and two occurrences of d in the string over the alphabet a,b,c,d. Also would "bcabcadada" be a valid string for this. If its not possible would this fall under context free language??
 
Back
Top