Learning subclasses of parallel communicating grammar systems

Authors:
Sindhu J. Kumaar;P. J. Abisha;D. G. Thomas
Affiliations:
Department of Mathematics, B.S. Abdur Rahman University, Chennai, Tamil Nadu, India;Department of Mathematics, Madras Christian College, Chennai, Tamil Nadu, India;Department of Mathematics, Madras Christian College, Chennai, Tamil Nadu, India
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 4
Cited 0

Formal languages

Formal languages
Learning regular sets from queries and counterexamples

Information and Computation
Grammar systems

Handbook of formal languages, vol. 2
Learning Subclasses of Pure Pattern Languages

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications

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 an algorithm to learn a parallel communicating grammar system in which the master component is a regular grammar and the other components are pure pattern grammars is given.