Repetition-Free Derivability from a Regular Grammar is NP-Hard
Jochen Burghardt
TL;DR
This paper proves that determining whether a word can be derived from a regular grammar without repeating any nonterminal is an NP-hard problem, highlighting computational complexity challenges.
Contribution
It establishes the NP-hardness of repetition-free derivability in regular grammars, a previously unresolved complexity question.
Findings
Repetition-free derivability from regular grammars is NP-hard.
The problem's computational complexity is now classified as NP-hard.
This result impacts parsing and formal language theory.
Abstract
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Machine Learning and Algorithms · Natural Language Processing Techniques