Skip to search formSkip to main contentSkip to account menu

Parikh's theorem

Parikh's theorem in theoretical computer science says that if one looks only at the relative number of occurrences of terminal symbols in a context… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Ambiguous grammarContext-free grammarContext-free languageFormal grammar

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Proving Parikh's theorem using Chomsky-Schutzenberger theorem
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this… 
2017
2017
Bacterial isolates from the Pediatric patients and its correlation with microbiological flora in tertiary care hospital
Background: Infection is a health hazard of great expense and significance affecting the final outcome of treatment. Hospital… 
2015
2015
Multipurpose prevention approaches with antiretroviral-based formulations 2 3
24 We compared the preclinical safety and efficacy of Tenofovir (TFV) 1% gel and 25 MZC gel containing 50 μM MIV-150 (M), 14 mM… 
2011
2011
A Regularity Measure for Context Free Grammars
Parikh's theorem states that every Context Free Language (CFL) has the same Parikh image as that of a regular language. A finite… 
2010
2010
Addition Operations on The Monadic Theories of Finite Structures
The results presented in this thesis are organized in two parts, both dealing with the logical properties of finite structures… 
Review
2007
Review
2007
Graphical Models for Primarily Unsupervised Sequence Labeling
Most models used in natural language processing must be trained on large corpora of labeled text. This tutorial explores a… 
2006
2006
The potential role of dietary calcium in obesity
There is substantial evidence from cellular, animal and epidemiological studies in support of a role for calcium, and in… 
2006
2006
Towards a Logical Analysis of Adjusted Winner Extended
It is often convenient to view a computational procedure, or a program, as a relation on a set of states, where a state can be… 
2004
2004
A complete characterization of a notion of contraction based on information-value
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and… 
1993
1993
Strengthening Parikh's theorem for weak Systems of Arithmetic
One of the basic results in the studies of weak systems of arithmetic is Parikh's theorem. In this paper we will be interested in…