Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.