# In Context of Chomskhy classification of formal languages

Is it possible that an ambiguous context free language also be a liner context free.
I have doubt regarding scope of ambiguous language in below Venn-diagram.

-

It was proved by Ogden (as an application of his famous Pumping Lemma) that $\{ a^ib^jc^k \mid i=j \mbox{ or } j=k \}$ is inherently ambiguous, meaning is has no unambiguous context-free grammar. At the same time the language is linear.