Volker Diekert, Steffen Kopecki. Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). In Michael Domaratzki, Kai Salomaa, editors, Implementation and Application of Automata - 15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers. Volume 6482 of Lecture Notes in Computer Science, pages 105-114, Springer, 2010. [doi]
Abstract is missing.