This HTML5 document contains 47 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/
n18https://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/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Straight-line_grammar
rdf:type
yago:Abstraction100002137 dbo:Book yago:Language106282651 yago:WikicatFormalLanguages yago:Communication100033020
rdfs:label
Straight-line grammar
rdfs:comment
A straight-line grammar (sometimes abbreviated as SLG) is a formal grammar that generates exactly one string. Consequently, it does not branch (every non-terminal has only one associated production rule) nor loop (if non-terminal A appears in a derivation of B, then B does not appear in a derivation of A).
dcterms:subject
dbc:Formal_languages
dbo:wikiPageID
19282986
dbo:wikiPageRevisionID
1082081188
dbo:wikiPageWikiLink
dbc:Formal_languages dbr:Directed_acyclic_graph dbr:Tree_(data_structure) dbr:Byte_pair_encoding dbr:Compressed_data_structure dbr:Lossless_data_compression dbr:Chomsky_normal_form dbr:Context-free_grammar dbr:Non-recursive_grammar dbr:Lempel-Ziv-Welch_algorithm dbr:Structure_discovery dbr:Directed_graph dbr:Straight-line_program dbr:Smallest_grammar_problem dbr:Formal_grammar dbr:Kolmogorov_complexity dbr:Sequitur_algorithm
owl:sameAs
yago-res:Straight-line_grammar freebase:m.04lfch8 wikidata:Q7620973 n18:4w3ZX
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Rp dbt:Annotated_link dbt:Refimprove dbt:Reflist dbt:Clarify dbt:Cn dbt:Citation_needed dbt:Use_American_English
dbp:date
October 2013
dbp:reason
Indicate how SLGs are used in each of these fields. E.g. in the current version of the 'Kolmogorov complexity' article, they are mentioned nowhere.
dbo:abstract
A straight-line grammar (sometimes abbreviated as SLG) is a formal grammar that generates exactly one string. Consequently, it does not branch (every non-terminal has only one associated production rule) nor loop (if non-terminal A appears in a derivation of B, then B does not appear in a derivation of A).
gold:hypernym
dbr:Grammar
prov:wasDerivedFrom
wikipedia-en:Straight-line_grammar?oldid=1082081188&ns=0
dbo:wikiPageLength
3405
foaf:isPrimaryTopicOf
wikipedia-en:Straight-line_grammar