Defining if a language is regular $L_4 = \{ w | w \text{ does not contain symbol a immediately followed by symbol b} \} $

where: $ \Sigma = \{ a, b, c \} $

So far I believe I have a defined regular grammar for this language, however I am having trouble coming up with an equivalent regular expression.

$&lt;Language\_4&gt; ::= a &lt;AOrC&gt; $

$&lt;Language\_4&gt; ::= b &lt;Language\_4&gt; $

$&lt;Language\_4&gt; ::= c &lt;Language\_4&gt; $

$&lt;Language\_4&gt; ::= \epsilon $

$&lt;AOrC&gt; ::= a &lt;Language\_4&gt; $

$&lt;AOrC&gt; ::= c &lt;Language\_4&gt; $

$&lt;AOrC&gt; ::= \epsilon $

Via a standard regex grammar this could be done via a lookahead, however I don't believe that the lookahead operation is a valid regular language operation.  I'm having trouble proving that if it is true though.

This is for a homework assignment, so I'm not expecting a full answer just some pointers in the right direction.

Edit

I went through this set of answers:
How to convert finite automata to regular expressions?

I then used Arden's Lemma as it seemed the most straight-forward.

First I defined:

$Q_0 = aQ_1 \cup bQ_0 \cup cQ_0 \cup \epsilon $

$Q_1 = cQ_0 \cup aQ_1 \cup \epsilon $

$ Q_1 = cQ_0 \cup aQ_1 \cup \epsilon $

Apply Arden's Lemma:

$ U = a $, 
$ L = Q_1 $,
$ V = cQ_0 $

Then I get:

$Q_1 = a * c Q_0 \cup \epsilon $

By then substituting $Q_1$ into $Q_0$ I get:

$Q_0 = a[a*cQ_0 \cup \epsilon] \cup bQ_0 \cup cQ_0 \cup \epsilon $

$Q_0 = \underbrace{(aa * ac \cup b \cup c)}_U \underbrace{Q_0}_L \cup \underbrace{a \cup \epsilon }_V $

$Q_0 = (aa * ac \cup b \cup c)* a$

Is this a correct application of the lemma?  

EDIT 2

I've tested the regex more and it doesn't match the desired language.  I think there may be an error in my application of the lemma. I'm going to try the application again in case I missed something.
Hint: Here are a few easier languages to practice on:


Every occurrence of the symbol $a$ is followed by a non-$a$ symbol. (Hint: every $a$ occurs in the context of $ab$ or $ac$.)
No occurrence of the symbol $a$ is followed by another $a$. (The only difference from 1 is that a word could end with $a$.)
Every occurrence of the symbol $a$ is followed by a non-$b$ symbol. (Hint: what are the possible contexts of $a$?)
Your language. (Combine the answers to 3 and 2.)