Simple proof of Parikh's theorem a la Takahashi
Formal Languages and Automata Theory
2019-09-23 v1
Abstract
In this report we describe a simple proof of Parikh's theorem a la Takahashi, based on a decomposition of derivation trees. The idea of decomposition is appeared in her master's thesis written in 1970.
Keywords
Cite
@article{arxiv.1909.09393,
title = {Simple proof of Parikh's theorem a la Takahashi},
author = {Ryoma Sin'ya},
journal= {arXiv preprint arXiv:1909.09393},
year = {2019}
}