Deciding Regularity of Hairpin Completions of Regular Languages in\n Polynomial Time | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Deciding Regularity of Hairpin Completions of Regular Languages in\n Polynomial Time

Identifier:nobleid.org/w1/20260515/7BDC2EBA

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/7BDC2EBA.svg?ark=w1%2F20260515%2F7BDC2EBA)](https://nobleid.org/work/w1/20260515/7BDC2EBA)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Steffen Kopecki

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy