Closest Substring Problems for Regular Languages - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yo-Sub Han, Sang-Ki Ko, Timothy Ng 0001, Kai Salomaa. Closest Substring Problems for Regular Languages. In Mizuho Hoshi, Shinnosuke Seki, editors, Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. Volume 11088 of Lecture Notes in Computer Science, pages 392-403, Springer, 2018. [doi]

This author has not been identified. Look up 'Yo-Sub Han' in GoogleThis author has not been identified. Look up 'Sang-Ki Ko' in GoogleThis author has not been identified. Look up 'Timothy Ng 0001' in GoogleThis author has not been identified. Look up 'Kai Salomaa' in Google

runs on WebDSL