Ordered term tree languages which are polynomial time inductively inferable from positive data (Q817835)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ordered term tree languages which are polynomial time inductively inferable from positive data |
scientific article; zbMATH DE number 5013330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordered term tree languages which are polynomial time inductively inferable from positive data |
scientific article; zbMATH DE number 5013330 |
Statements
Ordered term tree languages which are polynomial time inductively inferable from positive data (English)
0 references
20 March 2006
0 references
machine learning
0 references
inductive inference
0 references
tree structured pattern
0 references
0 references
0.8290402293205261
0 references
