P Systems without Priorities Are Computationally Universal-Reference-Cited by-同舟云学术

P Systems without Priorities Are Computationally Universal

Published:2003 Issue: Volume: Page:400-409
ISSN:0302-9743
Container-title:Membrane Computing
language:
Short-container-title:

Author:

Sosík Petr,Freund Rudolf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36490-0_28

Reference13 articles.

1. Calude, C.S., Păun, Gh.:Computing with Cells and Atoms.Taylor &Francis, London (2001)

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

3. Dassow, J., Păun, Gh.: On the Powe of Membrane Computing.Journal of Universal Computer Science 5, 2 (1999)33–39 ( http://www.iicm.edu/jucs )

4. Freund, R., Oswald, M.:GP Systems with Forbidding Context. Fundamenta Informaticae 49, 1–3 (2002) 81–102

5. Freund, R., Păun, Gh.: On the Numbe of Non-terminals in Graph-controlled, Programmed,and Matrix Grammars.In:Margenstern, M., Rogozhin, Y.(eds.): Proc.Conf.Universal Machines and Computations,Chişinău (2001).Springer-Verlag, Berlin (2001)

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

1. On maximal parallel application of rules in rewriting P systems;Journal of Membrane Computing;2023-08-24

2. On the computational efficiency of tissue P systems with evolutional symport/antiport rules;Knowledge-Based Systems;2023-02

3. On Bounded Symport/Antiport P Systems;DNA Computing;2006

4. On Pure Catalytic P Systems;Lecture Notes in Computer Science;2006

5. On Model-Checking of P Systems;Lecture Notes in Computer Science;2005