Yet another proof of Parikh's Theorem
Formal Languages and Automata Theory
2022-10-07 v1
Abstract
Parikh's Theorem says that the Parikh image of a context-free language is semilinear. We give a short proof of Parikh's Theorem using the formulation of Verma, Seidl, and Schwentick in terms of Presburger arithmetic. The proof relies on an Eulerian property of derivation trees of context-free languages and was inspired by Hierholzer's algorithm; it does not use the Chomsky normal form.
Keywords
Cite
@article{arxiv.2210.02925,
title = {Yet another proof of Parikh's Theorem},
author = {Manfred Kufleitner},
journal= {arXiv preprint arXiv:2210.02925},
year = {2022}
}