An incremental interactive algorithm for regular grammar inference

Rajesh Parekh, Vasant Honavar

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

16 Scopus citations

Abstract

We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly specifies a lattice of finite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and Mc is identified by searching the version-space using membership queries. We explore the problem of regular grammar inference in a setting where positive examples are provided intermittently. We provide an incremental version of the algorithm along with a set of sufficient conditions for its convergence.

Original languageEnglish (US)
Title of host publicationGrammatical Inference
Subtitle of host publicationLearning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings
EditorsColin de la Higuera, Laurent Miclet
PublisherSpringer Verlag
Pages238-249
Number of pages12
ISBN (Print)3540617787, 9783540617785
DOIs
StatePublished - 1996
Event3rd International Colloquium on Grammatical Inference, ICGI 1996 - Montpellier, France
Duration: Sep 25 1996Sep 27 1996

Publication series

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

Other

Other3rd International Colloquium on Grammatical Inference, ICGI 1996
Country/TerritoryFrance
CityMontpellier
Period9/25/969/27/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An incremental interactive algorithm for regular grammar inference'. Together they form a unique fingerprint.

Cite this