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 language | English (US) |
|---|---|
| Title of host publication | Proceedings of the National Conference on Artificial Intelligence |
| Editors | Anon |
| Publisher | AAAI |
| Pages | 1397 |
| Number of pages | 1 |
| Volume | 2 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) - Portland, OR, USA Duration: Aug 4 1996 → Aug 8 1996 |
Other
| Other | Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) |
|---|---|
| City | Portland, OR, USA |
| Period | 8/4/96 → 8/8/96 |
All Science Journal Classification (ASJC) codes
- Software