how to prove that every finite language is context-free?

Question

I am trying to prove that every finite language is context-free, is there any type of way that I could do it effectively?

score 2 · Accepted Answer · answered Mar 07 '17 at 21:49

2

It's not hard to show that every finite language is regular. If you know that every regular language is also context-free, you're done.

answered Mar 07 '17 at 21:49

Rick Decker

score -3 · Answer 2 · answered Apr 30 '17 at 17:24

-3

Every finite language is Regular. ( Because we can construct a finite automata for it )

Every regular language is cf. ( Because regular language is subset of cf )

Hence proved.

answered Apr 30 '17 at 17:24

Rimmi

2 Answers2