Polynomial-time identification of multiple context-free languages from positive data and membership queries

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing where each tuple of strings may occur in sentences of the language of the learning target. Our technique is based on Clark et al.'s work (ICGI 2008) on learning of a subclass of context-free languages. Our algorithm learns those context-free languages as well as many non-context-free languages.

Original languageEnglish
Title of host publicationGrammatical Inference
Subtitle of host publicationTheoretical Results and Applications - 10th International Colloquium, ICGI 2010, Proceedings
Pages230-244
Number of pages15
DOIs
Publication statusPublished - 2010 Nov 12
Externally publishedYes
Event10th International Colloquium on Grammatical Inference, ICGI 2010 - Valencia, Spain
Duration: 2010 Sep 132010 Sep 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6339 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Colloquium on Grammatical Inference, ICGI 2010
CountrySpain
CityValencia
Period10/9/1310/9/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Polynomial-time identification of multiple context-free languages from positive data and membership queries'. Together they form a unique fingerprint.

Cite this