Finite thickness (original) (raw)
In formal language theory, in particular in algorithmic learning theory, a class C of languages has finite thickness if every string is contained in at most finitely many languages in C. This condition was introduced by Dana Angluin as a sufficient condition for C being identifiable in the limit.
Property | Value |
---|---|
dbo:abstract | In formal language theory, in particular in algorithmic learning theory, a class C of languages has finite thickness if every string is contained in at most finitely many languages in C. This condition was introduced by Dana Angluin as a sufficient condition for C being identifiable in the limit. (en) Na teoria de linguagens formais, particularmente na teoria da aprendizagem algorítmica, uma classe C de linguagens tem espessura finita se toda cadeira de caracteres é contada em, no máximo, um número finito de linguagens em C. Essa condição foi introduzida por Dana Angluin como uma condição suficiente para C sendo identificável no limite. (pt) |
dbo:wikiPageID | 1309542 (xsd:integer) |
dbo:wikiPageLength | 3164 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID | 1032330489 (xsd:integer) |
dbo:wikiPageWikiLink | dbr:Algorithmic_learning_theory dbr:Dana_Angluin dbr:Language_identification_in_the_limit dbr:Formal_language_theory dbr:Formal_language dbc:Formal_languages dbr:Sufficient_condition |
dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Comp-sci-theory-stub |
dcterms:subject | dbc:Formal_languages |
rdf:type | yago:Abstraction100002137 yago:Communication100033020 yago:Language106282651 yago:WikicatFormalLanguages |
rdfs:comment | In formal language theory, in particular in algorithmic learning theory, a class C of languages has finite thickness if every string is contained in at most finitely many languages in C. This condition was introduced by Dana Angluin as a sufficient condition for C being identifiable in the limit. (en) Na teoria de linguagens formais, particularmente na teoria da aprendizagem algorítmica, uma classe C de linguagens tem espessura finita se toda cadeira de caracteres é contada em, no máximo, um número finito de linguagens em C. Essa condição foi introduzida por Dana Angluin como uma condição suficiente para C sendo identificável no limite. (pt) |
rdfs:label | Finite thickness (en) Espessura finita (pt) |
owl:sameAs | freebase:Finite thickness yago-res:Finite thickness wikidata:Finite thickness dbpedia-pt:Finite thickness https://global.dbpedia.org/id/4jRb7 |
prov:wasDerivedFrom | wikipedia-en:Finite_thickness?oldid=1032330489&ns=0 |
foaf:isPrimaryTopicOf | wikipedia-en:Finite_thickness |
is dbo:wikiPageRedirects of | dbr:M-finite_thickness dbr:MEF-condition dbr:MFF-condition |
is dbo:wikiPageWikiLink of | dbr:M-finite_thickness dbr:MEF-condition dbr:MFF-condition |
is foaf:primaryTopic of | wikipedia-en:Finite_thickness |