In this paper, we give a proof of Parikh’s semilinear theorem via Dickson’s lemma. It is notable that our proof provides a clear separation between properties derived from Dickson’s lemma and tree decomposition for context-free grammars.
Dickson’s Lemma, Higman’s Theorem and Beyond: A survey of some basic results in order theory