Developments from enquiries into the learnability of the pattern languages from positive data

Authors:
Yen Kaow Ng;Takeshi Shinohara
Affiliations:
26A, Jalan Lim Swee Aun, 34000, Taiping, Perak, Malaysia;Kyushu Institute of Technology, Department of Artificial Intelligence, Iizuka, 820, Japan
Venue:
Theoretical Computer Science
Year:
2008

Citing 40
Cited 14

Some problems on inductive inference from positive data

Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
A note on the two-variable pattern-finding problem

Journal of Computer and System Sciences
Identification of unions of languages drawn from an identifiable class

COLT '89 Proceedings of the second annual workshop on Computational learning theory
Polynomial-time inference of arbitrary pattern languages

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Inductive inference of monotonic formal systems from positive data

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
The correct definition of finite elasticity: corrigendum to identification of unions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Rewrite systems

Handbook of theoretical computer science (vol. B)
Learning elementary formal systems

Theoretical Computer Science
Rich classes inferable from positive data

Information and Computation
Decision problems for patterns

Journal of Computer and System Sciences
A generalization of the least general generalization

Machine intelligence 13
Learnability of a subclass of extended pattern languages

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Simple splicing systems

Discrete Applied Mathematics
Inference of Reversible Languages

Journal of the ACM (JACM)
Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
Some classes of Prolog programs inferable from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
An average-case optimal one-variable pattern language learner

Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Theoretical Computer Science
Algorithmic Program DeBugging

Algorithmic Program DeBugging
Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total

Annals of Mathematics and Artificial Intelligence
Polynomial Time Inference of Extended Regular Pattern Languages

Proceedings of RIMS Symposium on Software Science and Engineering
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial Time Inference of General Pattern Languages

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Learning and Consistency

Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
A Guided Tour Across the Boundaries of Learning Recursive Languages

Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Inductive Inference from Good Examples

AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Efficient Inductive Inference of Primitive Prologs from Positive Data

ALT '92 Proceedings of the Third Workshop on Algorithmic Learning Theory
Properties of Language Classes With Finite Elasticity

ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Language Learning from Good Examples

AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages

ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages

Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic
Advanced elementary formal systems

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Learnability of term rewrite systems from positive examples

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
From learning in the limit to stochastic finite learning

Theoretical Computer Science - Algorithmic learning theory
Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations

PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Inferring unions of the pattern languages by the most fitting covers

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
A class of prolog programs with non-linear outputs inferable from positive data

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Measuring over-generalization in the minimal multiple generalizations of biosequences

DS'05 Proceedings of the 8th international conference on Discovery Science

Learning indexed families of recursive languages from positive data: A survey

Theoretical Computer Science
Bad News on Decision Problems for Patterns

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The unambiguity of segmented morphisms

Discrete Applied Mathematics
Bad news on decision problems for patterns

Information and Computation
Existence and nonexistence of descriptive patterns

Theoretical Computer Science
Inclusion problems for patterns with a bounded number of variables

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders

Theoretical Computer Science
Patterns with bounded treewidth

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular and context-free pattern languages over small alphabets

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Inclusion problems for patterns with a bounded number of variables

Information and Computation
Fast learning of restricted regular expressions and DTDs

Proceedings of the 16th International Conference on Database Theory
Inferring descriptive generalisations of formal languages

Journal of Computer and System Sciences
A note on the complexity of matching patterns with variables

Information Processing Letters
Regular and context-free pattern languages over small alphabets

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The pattern languages are languages that are generated from patterns, and were first proposed by Angluin as a non-trivial class that is inferable from positive data [D. Angluin, Finding patterns common to a set of strings, Journal of Computer and System Sciences 21 (1980) 46-62; D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117-135]. In this paper we chronologize some results that developed from the investigations on the inferability of the pattern languages from positive data.