An interactive learning algorithm for acquisition of concepts represented as CFL
暂无分享,去创建一个
In this paper, an interactive learning algorithm of context-free language is presented. This algorithm is designed especially for system SAQ, which is a system for formal specification acquisition and verification. As the kernel of concept acquisition subsystem (SAQ/CL) of SAQ, the algorithm has been implemented on SUN SPARC workstation. The grammar to be obtained can represent sentence structure naturally.
[1] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[2] Sally Floyd,et al. The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.
[3] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[4] Takashi Yokomori. Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan , 1989, AII.
[5] Larry Peterson,et al. TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.