Incremental interactive algorithm for regular grammar inference

Rajesh Parekh, Vasant Honavar

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

1 Citation (Scopus)

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

Fingerprint

Finite automata

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Parekh, R., & Honavar, V. (1996). Incremental interactive algorithm for regular grammar inference. In Anon (Ed.), Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 1397). AAAI.
Parekh, Rajesh ; Honavar, Vasant. / Incremental interactive algorithm for regular grammar inference. Proceedings of the National Conference on Artificial Intelligence. editor / Anon. Vol. 2 AAAI, 1996. pp. 1397
@inproceedings{1f07083eb3ae4997bdb085585145df94,
title = "Incremental interactive algorithm for regular grammar inference",
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.",
author = "Rajesh Parekh and Vasant Honavar",
year = "1996",
language = "English (US)",
volume = "2",
pages = "1397",
editor = "Anon",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AAAI",

}

Parekh, R & Honavar, V 1996, Incremental interactive algorithm for regular grammar inference. in Anon (ed.), Proceedings of the National Conference on Artificial Intelligence. vol. 2, AAAI, pp. 1397, Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2), Portland, OR, USA, 8/4/96.

Incremental interactive algorithm for regular grammar inference. / Parekh, Rajesh; Honavar, Vasant.

Proceedings of the National Conference on Artificial Intelligence. ed. / Anon. Vol. 2 AAAI, 1996. p. 1397.

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

TY - GEN

T1 - Incremental interactive algorithm for regular grammar inference

AU - Parekh, Rajesh

AU - Honavar, Vasant

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030359488&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030359488&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 1397

BT - Proceedings of the National Conference on Artificial Intelligence

A2 - Anon, null

PB - AAAI

ER -

Parekh R, Honavar V. Incremental interactive algorithm for regular grammar inference. In Anon, editor, Proceedings of the National Conference on Artificial Intelligence. Vol. 2. AAAI. 1996. p. 1397