Learning Subclasses of Pure Pattern Languages

Authors:
P. J. Abisha;D. G. Thomas;Sindhu J. Kumaar
Affiliations:
Department of Mathematics, Madras Christian College, Chennai, 600 059;Department of Mathematics, Madras Christian College, Chennai, 600 059;Department of Mathematics, Crescent Engineering College, Chennai, 600 048
Venue:
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Year:
2008

Citing 2
Cited 2

Learning regular sets from queries and counterexamples

Information and Computation
Theory of Codes

Theory of Codes

Learning subclasses of parallel communicating grammar systems

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Semantic separator learning and its applications in unsupervised Chinese text parsing

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper, we study the problem of learning pure pattern languages using queries and examples.