Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Volker Diekert, Steffen Kopecki, Victor Mitrana. Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput., 217:12-30, 2012. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is RegularVolker Diekert, Steffen Kopecki. ijfcs, 22(8):1813-1828, 2011. [doi] On the Hairpin Completion of Regular LanguagesVolker Diekert, Steffen Kopecki, Victor Mitrana. ictac 2009: 170-184 [doi]
The following publications are possibly variants of this publication: