This HTML5 document contains 1 embedded RDF statements represented using HTML+Microdata notation.
The embedded RDF content will be recognized by any processor of HTML5 Microdata.
| Prefix | Namespace IRI |
|---|
| n2 | http://dbpedia.org/resource/Parikh' |
| rdfs | http://www.w3.org/2000/01/rdf-schema# |
| rdf | http://www.w3.org/1999/02/22-rdf-syntax-ns# |
| xsdh | http://www.w3.org/2001/XMLSchema# |
- Subject Item
- n2:s_theorem
- rdfs:comment
-
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-free language, without regard to their order, then the language is indistinguishable from a regular language. It is useful for deciding whether or not a string with a given number of some terminals is accepted by a context-free grammar. It was first proved by Rohit Parikh in 1961 and republished in 1966.