Parikh's theorem
Parikh's theorem in theoretical computer science says that if one looks only at the number of occurrences of each terminal symbol in a context-free language, without regard to their order, then the language is indistinguishable from a regular language. It is useful for deciding that strings with a given number of terminals are not accepted by a context-free grammar. It was first proved by Rohit Parikh in 1961 and republished in 1966.
known for
Link from a Wikipage to another Wikipage
primaryTopic
Parikh's theorem
Parikh's theorem in theoretical computer science says that if one looks only at the number of occurrences of each terminal symbol in a context-free language, without regard to their order, then the language is indistinguishable from a regular language. It is useful for deciding that strings with a given number of terminals are not accepted by a context-free grammar. It was first proved by Rohit Parikh in 1961 and republished in 1966.
has abstract
En informatique théorique, et ...... uels d'informatique théorique.
@fr
Parikh's theorem in theoretica ...... 1961 and republished in 1966.
@en
在理論計算機科學中，帕里克定理指出，对于上下文无关语言，如果 ...... 法接受。1961年第一次证明了它，论文于1966年再次发表。
@zh
Wikipage page ID
26,511,174
page length (characters) of wiki page
Wikipage revision ID
989,421,521
Link from a Wikipage to another Wikipage
date
April 2017
@en
reason
why exactly?
@en
wikiPageUsesTemplate
subject
comment
En informatique théorique, et ...... uels d'informatique théorique.
@fr
Parikh's theorem in theoretica ...... 1961 and republished in 1966.
@en
在理論計算機科學中，帕里克定理指出，对于上下文无关语言，如果 ...... 法接受。1961年第一次证明了它，论文于1966年再次发表。
@zh
label
Parikh's theorem
@en
Théorème de Parikh
@fr
帕里克定理
@zh