On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars-Reference-Cited by-同舟云学术

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

Published:2001 Issue: Volume: Page:214-225
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Freund Rudolf,Păun Gheorghe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45132-3_14

Reference8 articles.

1. C. Calude and Gh. Păun. Computing with Cells and Atoms. Taylor and Francis, London, 2000.

2. J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989.

3. H. Fernau. Nonterminal complexity of programmed grammars. This volume.

4. R. Freund and Gh. Păun. Computing with Membranes: Three More Collapsing Hierarchies. Submitted, 2000 (also presented at the EMCC Meeting in Milano, Italy, November 3rd, 2000).

5. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, USA.

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parsimonious Computational Completeness;Developments in Language Theory;2021

2. Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective;Membrane Computing;2021

3. On describing super-linear languages by matrix insertion–deletion systems;International Journal of Advances in Engineering Sciences and Applied Mathematics;2019-03

4. Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems;Journal of Membrane Computing;2019-02-01

5. Investigations on the power of matrix insertion-deletion systems with small sizes;Natural Computing;2017-12-05