当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Proof of Parikh’s Theorem via Dickson’s Lemma
International Journal of Foundations of Computer Science ( IF 0.6 ) Pub Date : 2021-01-14 , DOI: 10.1142/s012905412150009x
Toshihiro Koga 1
Affiliation  

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 引理给出了 Parikh 半线性定理的证明。值得注意的是,我们的证明明确区分了从迪克森引理派生的属性和上下文无关文法的树分解。
更新日期:2021-01-14
down
wechat
bug