Direct constructions of universal extended H systems

作者: Pierluigi Frisco

DOI: 10.1016/S0304-3975(02)00658-8

关键词:

摘要: A direct universal extended H system receives as input the coding of an with a particular control mechanism and simulates it. We present construction for five kinds systems under consideration. It is first time that described: results obtained until now were based on simulation type-0 grammars or Turing machine.

参考文章(19)
Păun G, Csuhaj-Varjú E, Kari L, Freund R, DNA computing based on splicing: universality results. pacific symposium on biocomputing. pp. 179- 190 ,(1996)
Pierluigi Frisco, G. Mauri, C. Ferretti, Simulating Turing Machines by Extended mH Systems Computing with bio-molecules. pp. 221- 238 ,(1998)
Nor Muhainiah, Mohd. Ali, Formal language theory and DNA ,(2004)
Pierluigi Frisco, A Direct Construction of a Universal Extended H System machines computations and universality. pp. 226- 239 ,(2001) , 10.1007/3-540-45132-3_15
Computing by splicing: programmed and evolving splicing systems ieee international conference on evolutionary computation. pp. 273- 277 ,(1997) , 10.1109/ICEC.1997.592313
K. L. Denninghoff, R. W. Gatterdam, On the undecidability of splicing systems International Journal of Computer Mathematics. ,vol. 27, pp. 133- 145 ,(1989) , 10.1080/00207168908803715
A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction Proceedings of the London Mathematical Society. ,vol. s2-43, pp. 544- 546 ,(1938) , 10.1112/PLMS/S2-43.6.544
Gheorghe Pâun, Grzegorz Rozenberg, Arto Salomaa, Restricted use of the splicing operation International Journal of Computer Mathematics. ,vol. 60, pp. 17- 32 ,(1996) , 10.1080/00207169608804472
Yurii Rogozhin, Small universal Turing machines Theoretical Computer Science. ,vol. 168, pp. 215- 240 ,(1996) , 10.1016/S0304-3975(96)00077-1