Consider the language over chars a$,$ b and c where

there is exactly one a

there can be any number of as and bs $($including $0)$

there can be any number of cs $($including $0)$

then there must be precisely one a at the end