On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

Rudolf Freund, Gheorghe Paun. On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix 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 214-225, Springer, 2001. [doi]

@inproceedings{FreundP01,
  title = {On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars},
  author = {Rudolf Freund and Gheorghe Paun},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2055/20550214.htm},
  tags = {graph-rewriting, rewriting, grammar},
  researchr = {https://researchr.org/publication/FreundP01},
  cites = {0},
  citedby = {0},
  pages = {214-225},
  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},
}