"It Is NL-complete to Decide Whether a Hairpin Completion of Regular ..."

Volker Diekert, Steffen Kopecki (2011)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1101-4824
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1101-4824
Volker Diekert, Steffen Kopecki:
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular. CoRR abs/1101.4824 (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.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.