2000 character limit reached
Simple proof of Parikh's theorem a la Takahashi
Published 20 Sep 2019 in cs.FL | (1909.09393v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
