"It is NL-Complete to Decide Whether a Hairpin Completion of Regular ..."

Volker Diekert, Steffen Kopecki (2011)

> Home

Details and statistics

DOI: 10.1142/S0129054111009057

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/DiekertK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/DiekertK11
Volker Diekert, Steffen Kopecki:
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Int. J. Found. Comput. Sci. 22(8): 1813-1828 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.