Context-free grammars are more expressive than finite automata; if a language L is by a finite automata then L can be by a context-free grammar.