13th International Conference on Membrane Computing - MTA Sztaki

Yu. Rogozhin
10. J. Cocke, M. Minsky: Universality of tag systems with P = 2. Journal of the
Association for Computing Machinery 11(1) 1520 (1964).
11. R. J. Lipton: DNA solution of hard computational problems. Science 268 (1995)
542–545.
12. L. Priese, Yu. Rogozhin, M. Margenstern: Finite H-systems with 3 test tubes are
not predictable. In Proceedings of Pacific Simposium on Biocomputing (R.Altman,
A.Dunker, L.Hanter, T.Klein eds.), World Sci.Publ., Singapore, (1998) 545–556.
13. R. Freund, A. Alhazov, Yu. Rogozhin, S. Verlan: Communication P Systems. Chapter
5 in: Gh. Păun, G. Rozenberg, A. Salomaa: The Oxford Handbook of Membrane
Computing (2010) 118–143.
14. P. Frisco: Computing with Cells: Advances in Membrane Computing. Oxford University
press, (2009).
15. T. Head: Formal language theory and DNA: an analysis of the generative capacity
of recombinant behaviors. Bulletin of Mathematical Biology 49 (1987) 737–759.
16. Gh. Păun, G. Rozenberg, A. Salomaa: DNA Computing: New Computing
Paradigms. Springer Verlag, Berlin, Heidelberg, New York, (1998).
17. M. Margenstern: Frontier between decidability and undecidability: a survey. Theoretical
Computer Science 231(2) (2000) 217 – 251.
18. M. Margenstern: Surprising Areas in the Quest for Small Universal Devices. Electronic
Notes in Theoretical Computer Science 225 (2009) 201 – 220.
19. M. Margenstern, L. Pavlotskaya: On the optimal number of instructions for universality
of Turing machines connected with a finite automaton. <strong>International</strong> Journal
of Algebra and Computation 13(2) (2003) 133–202.
20. M. Minsky: Computation, finite and infinite machines. Prentice-Hall, Englewood
Cliffs (1967).
21. T. Neary, D. Woods: The Complexity of Small Universal Turing Machines: A Survey.
LNCS 7147 (2012) 385 – 405.
22. Liesbeth De Mol: Tag systems and Collatz-like functions. Theoretical Computer
Science 390 (2008) 92–101.
23. Gh. Păun: Computing with membranes. Journal of Computer and System Sciences
1(61) (2000) 108–143. Also TUCS Report No. 208 (1998).
24. Gh. Păun, G. Rozenberg, A. Salomaa A. (eds.): The Oxford Handbook of Membrane
Computing. Oxford University Press, (2010).
25. L. Pavlotskaya: Solvability of the halting problem for certain classes of Turing
machines. Mathematical Notes 13(6) (1973) 537–541; Translated from Matematicheskie
Zametki, 13(6) (1973) 899–909.
26. E. L. Post: Formal reductions of the general combinatorial decision problem. American
Journal of Mathematics 65(2) (1943) 197–215.
27. R. M. Robinson: Minsky’s Small Universal Turing Machine. <strong>International</strong> Journal
of Mathematics Vol.2, No.5 (1991) 551 – 562.
28. Yu. Rogozhin: Small universal Turing machines. Theoretical Computer Science
168(2) (1996) 215-240.
29. Yu. Rogozhin, S. Verlan: On the rule complexity of universal tissue P systems.
Lecture Notes in Computer Science 3850 (2006) 356–362.
30. Yu. Rogozhin, S.Verlan: Small universal T ag 1 P system (in preparation).
31. C. E. Shannon: A universal Turing machines with two internal states. Automata
Studies, Ann. of Math. Stud. 34 (1956) 157 – 165.
32. A. M. Turing: On Computable real numbers, with an application to the Entscheidungsproblem.
Proc. London Math. Soc. Ser 2 42 (1936) 230 – 265.
62