Repetition-Free Derivability from a Regular Grammar is NP-Hard
Formal Languages and Automata Theory
2016-02-24 v2 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1602.05555,
title = {Repetition-Free Derivability from a Regular Grammar is NP-Hard},
author = {Jochen Burghardt},
journal= {arXiv preprint arXiv:1602.05555},
year = {2016}
}
Comments
Technical report; 13 pages; 6 figures