@article{CIAA-J-2010-DiekertK11,
	author        = "Volker Diekert and Steffen Kopecki",
	doi           = "10.1142/S0129054111009057",
	journal       = "{International Journal of Foundations of Computer Science}",
	number        = 8,
	pages         = "1813--1828",
	publisher     = "{World Scientific}",
	title         = "{It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular}",
	volume        = 22,
	year          = 2011,
}