arXiv · 2611.16562
The Regular Cover Problem is NP-complete
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stefan Hetzl, Parham Shadman. 2026-11-12. The Regular Cover Problem is NP-complete. https://searcharxiv.com/abs/2611.16562
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.