It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular

Volker Diekert, Steffen Kopecki. It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Int. J. Found. Comput. Sci., 22(8):1813-1828, 2011. [doi]

Abstract

Abstract is missing.