This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-zhhttp://zh.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Rohit_Jivanlal_Parikh
dbo:wikiPageWikiLink
dbr:Parikh's_theorem
dbo:knownFor
dbr:Parikh's_theorem
Subject Item
dbr:Parikh's_theorem
rdf:type
yago:Language106282651 yago:Communication100033020 yago:Abstraction100002137 yago:WikicatFormalLanguages
rdfs:label
Théorème de Parikh Parikh's theorem 帕里克定理
rdfs:comment
En informatique théorique, et notamment dans la théorie des langages algébriques, le théorème de Parikh est un théorème qui compare les fréquences relatives d'apparition des lettres dans un langage algébrique. Il dit que si on compte, dans un langage formel, uniquement le nombre d'apparitions des lettres dans un mot, on ne peut pas distinguer les langages algébriques des langages rationnels. Ce théorème a été prouvé par Rohit Parikh en 1966, et il figure dans bon nombre de manuels d'informatique théorique. 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. 在理論計算機科學中，帕里克定理指出，对于上下文无关语言，如果只关心其中每个终止符号出现的次数，而不考虑它们的顺序，那么存在正则语言与其对应。这个定理可用于确定具有给定数量终止符号的字符串是否能为上下文无关语法接受。1961年第一次证明了它，论文于1966年再次发表。
dcterms:subject
dbc:Formal_languages
dbo:wikiPageID
26511174
dbo:wikiPageRevisionID
1059756872
dbo:wikiPageWikiLink
dbr:Ambiguous_grammar dbr:Alphabet_(formal_languages) dbr:Inherently_ambiguous_language dbr:Context-free_grammar dbr:Rohit_Jivanlal_Parikh dbr:Regular_language dbr:Context-free_language dbr:Formal_grammar dbr:Theoretical_computer_science dbc:Formal_languages
owl:sameAs
dbpedia-fr:Théorème_de_Parikh wikidata:Q7137090 dbpedia-zh:帕里克定理 dbpedia-fa:نظریه_پاریک n17:4tKXC yago-res:Parikh's_theorem freebase:m.0bhb45x
dbp:wikiPageUsesTemplate
dbt:Explain
dbp:date
April 2017
dbp:reason
why exactly?
dbo:abstract
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. 在理論計算機科學中，帕里克定理指出，对于上下文无关语言，如果只关心其中每个终止符号出现的次数，而不考虑它们的顺序，那么存在正则语言与其对应。这个定理可用于确定具有给定数量终止符号的字符串是否能为上下文无关语法接受。1961年第一次证明了它，论文于1966年再次发表。 En informatique théorique, et notamment dans la théorie des langages algébriques, le théorème de Parikh est un théorème qui compare les fréquences relatives d'apparition des lettres dans un langage algébrique. Il dit que si on compte, dans un langage formel, uniquement le nombre d'apparitions des lettres dans un mot, on ne peut pas distinguer les langages algébriques des langages rationnels. Ce théorème a été prouvé par Rohit Parikh en 1966, et il figure dans bon nombre de manuels d'informatique théorique.
prov:wasDerivedFrom
wikipedia-en:Parikh's_theorem?oldid=1059756872&ns=0
dbo:wikiPageLength
4943
foaf:isPrimaryTopicOf
wikipedia-en:Parikh's_theorem
Subject Item
dbr:Context-free_language
dbo:wikiPageWikiLink
dbr:Parikh's_theorem
Subject Item
dbr:Ambiguous_grammar
dbo:wikiPageWikiLink
dbr:Parikh's_theorem
Subject Item
wikipedia-en:Parikh's_theorem
foaf:primaryTopic
dbr:Parikh's_theorem