I am trying to create a regular expression that will generate the following language under the {a,b,c} alphabet:all words that do not contain the substring bbcI am having a really hard time understanding how to approach this question. I have done several other questions where a certain substring must be excluded, but this one really messes with my logic.Thanks in advance
A little help with regular expressions
formal languages;regular expressions;substrings