Computationally universal P systems without priorities: two catalysts are sufficient

@article{Freund2005ComputationallyUP,
  title={Computationally universal P systems without priorities: two catalysts are sufficient},
  author={Rudolf Freund and Lila Kari and Marion Oswald and Petr Sos{\'i}k},
  journal={Theor. Comput. Sci.},
  year={2005},
  volume={330},
  pages={251-266}
}
The original model of P systems with symbol objects introduced by P ̆ aun was shown to be computationally universal, provided that catalysts and priorities of rules are used. By reduction via register machines Sosík and Freund proved that the priorities may be omitted from the model without loss of computational power. Freund, Oswald, and Sosík considered several variants of P systems with catalysts (but without priorities) and investigated the number of catalysts needed for these specific… CONTINUE READING

From This Paper

Topics from this paper.
70 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Gy

  • E. Csuhaj-Varjú
  • Vaszil, P automata or purely communicating…
  • 2003
Highly Influential
10 Excerpts

L

  • R. Freund
  • Kari,M.Oswald, P. Sosík, Computationally…
  • 2003
1 Excerpt

aun,On thenumberofnon-terminals ingraph-controlled, programmed,andmatrixgrammars, in: M.Margenstern,Y. Rogozhin (Eds.), Machines, Computations andUniversality

  • R.Freund, Gh.P
  • 3rd Internat. Conf., MCU
  • 2001
1 Excerpt

From regulated rewriting to computingwithmembranes : collapsing hierarchies , Theoret

  • M. Margenstern, Y. Rogozhin, Gh. Păun Freund
  • Comput . Sci .
  • 1999

Similar Papers

Loading similar papers…