Ordered term tree languages which are polynomial time inductively inferable from positive data
type: Item
instance of: scholarly article
title: Ordered term tree languages which are polynomial time inductively inferable from positive data
zbMATH Open document ID: 1086.68114
author: Yusuke Suzuki
author: Takayoshi Shoudai
author: Tomoyuki Uchida
author: Tetsuhiro Miyahara
published in: Theoretical Computer Science
publication date: 2006-03-20T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5013330
zbMATH Keywords: machine learning
zbMATH Keywords: inductive inference
zbMATH Keywords: tree structured pattern
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.022
OpenAlex ID: W2130999259
cites work: Finding patterns common to a set of strings
cites work: Inductive inference of formal languages from positive data
cites work: Queries and concept learning
cites work: Q4473562
cites work: Q4942639
cites work: Q4370226
cites work: Algorithmic Learning Theory
cites work: Q4415196
cites work: Q4739215
cites work: Q4749224
cites work: Q4524836
cites work: Q4782721
cites work: Q3046705
cites work: Inductive Logic Programming
cites work: Q4413498
DOI: 10.1016/J.TCS.2005.10.022
description: scientific article; zbMATH DE number 5013330