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]

Abstract

Abstract is missing.