Deciding regularity of hairpin completions of regular languages in polynomial time

Volker Diekert, Steffen Kopecki, Victor Mitrana. Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput., 217:12-30, 2012. [doi]

Abstract

Abstract is missing.