Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract)

Alvis Brazma, Esko Ukkonen, Jaak Vilo. Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). In Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, editors, Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings. Volume 1178 of Lecture Notes in Computer Science, pages 95-104, Springer, 1996.

Abstract

Abstract is missing.