Computing maximal Kleene closures that are embeddable in a given subword-closed language

Stavros Konstantinidis, Nicolae Santean. Computing maximal Kleene closures that are embeddable in a given subword-closed language. Natural Computing, 12(2):211-222, 2013. [doi]

Authors

Stavros Konstantinidis

This author has not been identified. Look up 'Stavros Konstantinidis' in Google

Nicolae Santean

This author has not been identified. Look up 'Nicolae Santean' in Google