Proving Parikh's theorem using Chomsky-Schutzenberger theorem

10/26/2017
by   Dmitry Golubenko, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

A Reunion of Godel, Tarski, Carnap, and Rosser

We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinab...
research
06/10/2019

Formalization of the Axiom of Choice and its Equivalent Theorems

In this paper, we describe the formalization of the axiom of choice and ...
research
10/11/2022

Formalizing May's Theorem

This report presents a formalization of May's theorem in the proof assis...
research
06/02/2018

GamePad: A Learning Environment for Theorem Proving

In this paper, we introduce a system called GamePad that can be used to ...
research
03/02/2022

A Modern Gauss-Markov Theorem? Really?

We show that the theorems in Hansen (2021a) (the version accepted by Eco...
research
06/27/2023

LeanDojo: Theorem Proving with Retrieval-Augmented Language Models

Large language models (LLMs) have shown promise in proving formal theore...
research
10/31/2021

Gács-Kučera's Theorem Revisited by Levin

Leonid Levin (arxiv.org/abs/cs/0503039v14, p.7) published a new (and ver...

Please sign up or login with your details

Forgot password? Click here to reset