Regular Expressions I

Computer Science Level 3

Let R be the language described by the following regular expression:


How many of the following strings are NOT members of R?

abc, aabbd, df, abbcdf, abdef, bbacf, 
abbbbbbdef, aabbcef, abbceef, abababcf, 
abcdf, f, ef, def, be, abe, acef

Problem Loading...

Note Loading...

Set Loading...