The Regular Cover Problem is NP-complete

The regular cover problem is the following question: given a finite language $L$ and a $k\geq 0$, is there an acyclic regular grammar $G$ with at most $k$ productions that covers $L$, i.e., that satisfies $L(G) \supseteq L$. The study of this problem is motivated by applications in proof theory and automated deduction. The regular cover problem is known to be in NP. In this paper we show that it is NP-complete by reducing the vertex cover problem for graphs with maximum degree three to it.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16562
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Regular Cover Problem is NP-complete

Stefan Hetzl, Parham Shadman
arXiv (Cornell University)
semigroups and automata theory
preprint

The Regular Cover Problem is NP-complete

Stefan Hetzl, Parham Shadman
preprint en

Abstract

The regular cover problem is the following question: given a finite language $L$ and a $k\geq 0$, is there an acyclic regular grammar $G$ with at most $k$ productions that covers $L$, i.e., that satisfies $L(G) \supseteq L$. The study of this problem is motivated by applications in proof theory and automated deduction. The regular cover problem is known to be in NP. In this paper we show that it is NP-complete by reducing the vertex cover problem for graphs with maximum degree three to it.

arXiv (Cornell University)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon