论文信息 - Repetition-Free Derivability from a Regular Grammar is NP-Hard

Repetition-Free Derivability from a Regular Grammar is NP-Hard

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.

Jochen Burghardt

[1] Jochen Burghardt,et al. E-generalization using grammars , 2005, Artif. Intell..

[2] Birgit Heinz. Anti-Unifikation modulo Gleichungstheorie und deren Anwendung zur Lemmagenerierung , 1996, GMD-Bericht.

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.

[5] Bertrand Jeannet,et al. Analysis of Communicating Infinite State Machines using Lattice Automata , 2007 .

[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .