2000 character limit reached
Proving Parikh's theorem using Chomsky-Schutzenberger theorem
Published 26 Oct 2017 in cs.FL and cs.DM | (1710.09612v2)
Abstract: Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
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.