Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,648,013 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Ambiguous grammar
Context-free grammar
Context-free language
Formal grammar
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Simple proof of Parikh's theorem a la Takahashi
Ryoma Sin'ya
arXiv.org
2019
Corpus ID: 202712740
In this report we describe a simple proof of Parikh's theorem a la Takahashi, based on a decomposition of derivation trees. The…
Expand
Review
2015
Review
2015
Quantifying slum electrification in India and explaining local variation
M. Aklin
,
P. Bayer
,
S. P. Harish
,
Johannes Urpelainen
2015
Corpus ID: 3588764
2012
2012
Technical Efficiency in Smallholder Paddy Farms in Ghana: an Analysis Based on Different Farming Systems and Gender
S. Al-hassan
2012
Corpus ID: 55418201
One way of achieving sustained increase in food production in developing countries is to ensure efficient utilisation of scarce…
Expand
2012
2012
Determination of Activation Energy from Pyrolysis of Paper Cup Waste Using Thermogravimetric Analysis
R. Singh
,
B. Biswal
,
Sachin Kumar
2012
Corpus ID: 55420512
Paper cups waste represents a valuable source of energy. Therefore, it is studied to determine the quantity of energy obtained…
Expand
2012
2012
Parikh's Theorem and Descriptional Complexity
G. Lavado
,
G. Pighizzini
Conference on Current Trends in Theory and…
2012
Corpus ID: 13953743
It is well known that for each context-free language there exists a regular language with the same Parikh image. We investigate…
Expand
2011
2011
An Extension of Parikh's Theorem beyond Idempotence
Michael Luttenberger
arXiv.org
2011
Corpus ID: 12564058
The commutative ambiguity cambG,X of a context-free grammar G with start symbol X assigns to each Parikh vector v the number of…
Expand
2010
2010
Parikh's Theorem: A simple and direct construction
J. Esparza
,
P. Ganty
,
S. Kiefer
,
Michael Luttenberger
arXiv.org
2010
Corpus ID: 15987978
Parikh’s theorem states that every context-free language has the same Parikh image as some regular language. We present a very…
Expand
Review
2005
Review
2005
Support of Online Learning through Intelligent Programs
M. Hamdi
2005
Corpus ID: 54764524
Distance learning through the Internet is changing educational paradigms. Learning approaches, teaching methods, students…
Expand
2004
2004
A complete characterization of a notion of contraction based on information-value
Horacio L. Arló-Costa
,
I. Levi
Non-Monotonic Reasoning
2004
Corpus ID: 18151990
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and…
Expand
2000
2000
Total synthesis of herboxidiene, a complex polyketide from Streptomyces species A7847
M. Banwell
,
M. McLeod
,
Rajaratnam Premraj
,
G. Simpson
2000
Corpus ID: 98504336
Abstract A formal total synthesis of the polyketide herboxidiene (1) has been achieved by Horner-Wittig coupling of the side…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE