Automatic learning of subclasses of pattern languages
type: Item
instance of: scholarly article
title: Automatic learning of subclasses of pattern languages
zbMATH Open document ID: 1279.68139
author: John Case
author: Sanjay Jain
author: Trong Dao Le
author: Yuh Shin Ong
author: Pavel Semukhin
author: Frank Stephan
published in: Information and Computation
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6110710
zbMATH Keywords: pattern languages
zbMATH Keywords: automatic learning
zbMATH Keywords: automatic classes
zbMATH Keywords: membership problem
MaRDI profile type: Publication
full work available at URL: j.ic.2012.07.001
OpenAlex ID: W2037750176
cites work: Inductive inference of formal languages from positive data
cites work: Finding patterns common to a set of strings
cites work: Inference of Reversible Languages
cites work: Learning regular sets from queries and counterexamples
cites work: Toward a mathematical theory of inductive inference
cites work: Finite presentations of infinite structures: Automata and interpretations
cites work: Learning a subclass of regular patterns in polynomial time
cites work: Identification of function distinguishable languages.
cites work: On the impact of forgetting on learning machines
cites work: Language identification in the limit
cites work: Q4247007
cites work: Q3312199
cites work: Uncountable automatic classes and learning
cites work: Learnability of Automatic Classes
cites work: ON AUTOMATIC FAMILIES
cites work: Robust Learning of Automatic Classes of Languages
cites work: Three Lectures on Automatic Structures
cites work: Q3396632
cites work: Language learning from texts: Mindchanges, limited memory and monotonicity
cites work: Polynomial-time inference of arbitrary pattern languages
cites work: Incremental learning from positive data
cites work: Learning indexed families of recursive languages from positive data: A survey
cites work: An introduction to Kolmogorov complexity and its applications
cites work: A non-learnable class of E-pattern languages
cites work: STACS 2004
cites work: Automata Presenting Structures: A Survey of the Finite String Case
cites work: Q4749224
cites work: Q4115138
DOI: 10.1016/J.IC.2012.07.001
Recommended article: Automatic Learning of Subclasses of Pattern Languages
Recommended article: Learning Subclasses of Pure Pattern Languages
Recommended article: Q4599182
Recommended article: Case-based representation and learning of pattern languages
Recommended article: Polynomial-Time Algorithms for Learning Typed Pattern Languages
Recommended article: Q4955324
Recommended article: Stochastic finite learning of the pattern languages
Recommended article: A Language of Patterns for Subterm Selection
Recommended article: Q4703851
Recommended article: Learning Pattern Languages over Groups
description: scientific article; zbMATH DE number 6110710