Henning Fernau. Nonterminal Complexity of Programmed Grammars. In Maurice Margenstern, Yurii Rogozhin, editors, Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldavia, May 23-27, 2001, Proceedings. Volume 2055 of Lecture Notes in Computer Science, pages 202-213, Springer, 2001. [doi]
@inproceedings{Fernau01:1, title = {Nonterminal Complexity of Programmed Grammars}, author = {Henning Fernau}, year = {2001}, url = {http://link.springer.de/link/service/series/0558/bibs/2055/20550202.htm}, tags = {grammar}, researchr = {https://researchr.org/publication/Fernau01%3A1}, cites = {0}, citedby = {0}, pages = {202-213}, booktitle = {Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldavia, May 23-27, 2001, Proceedings}, editor = {Maurice Margenstern and Yurii Rogozhin}, volume = {2055}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-42121-1}, }