Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Parikh's_theorem> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Parikh's_theorem abstract "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.".
- Parikh's_theorem wikiPageID "26511174".
- Parikh's_theorem wikiPageRevisionID "594470419".
- Parikh's_theorem hasPhotoCollection Parikh's_theorem.
- Parikh's_theorem subject Category:Formal_languages.
- Parikh's_theorem type Abstraction100002137.
- Parikh's_theorem type Communication100033020.
- Parikh's_theorem type FormalLanguages.
- Parikh's_theorem type Language106282651.
- Parikh's_theorem 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.".
- Parikh's_theorem label "Parikh's theorem".
- Parikh's_theorem sameAs m.0bhb45x.
- Parikh's_theorem sameAs Q7137090.
- Parikh's_theorem sameAs Q7137090.
- Parikh's_theorem sameAs Parikh's_theorem.
- Parikh's_theorem wasDerivedFrom Parikh's_theorem?oldid=594470419.
- Parikh's_theorem isPrimaryTopicOf Parikh's_theorem.