External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)

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]

Authors

Volker Diekert

This author has not been identified. Look up 'Volker Diekert' in Google

Steffen Kopecki

This author has not been identified. Look up 'Steffen Kopecki' in Google
runs on