Incremental interactive algorithm for regular grammar inference

Rajesh Parekh, Vasant Honavar

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

2 Scopus citations

Abstract

An interactive incremental algorithm is proposed for regular grammar inference of a finite state automaton (FSA). The algorithm relaxes the structural completeness assumption, thereby allowing the learner to perform candidate elimination by posing safe member queries to the teacher. When an structurally complete set for the target FSA is achieved, lattice updates cease and all queries are treated as safe. The algorithm then converges to the target FSA.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Editors Anon
PublisherAAAI
Pages1397
Number of pages1
Volume2
StatePublished - 1996
EventProceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) - Portland, OR, USA
Duration: Aug 4 1996Aug 8 1996

Other

OtherProceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2)
CityPortland, OR, USA
Period8/4/968/8/96

All Science Journal Classification (ASJC) codes

  • Software

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

Cite this