On reversibility and determinism in P systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5957 LNCS, Issue , 2010, Pages 158-168

  Alhazov, Artiom ^a,b   Morita, Kenichi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

^b INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARALLEL COMPUTING; FINITE SET; FORMAL FRAMEWORK; MEMBRANE COMPUTING; P SYSTEMS; REGULAR SETS; REVERSIBLE SYSTEMS; SYNTACTIC PROPERTIES;

PARALLEL ARCHITECTURES; SET THEORY;

BIOINFORMATICS;

EID: 77949602895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11467-0_12     Document Type: Conference Paper

References (14)

1. Agrigoroaiei, O., Ciobanu, G.: Dual P Systems. In: Corne, D.W., Frisco, P., Paun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 95-107. Springer, Heidelberg (2009)
2. Bennett, C.H.: Logical reversibility of computation. IBM Journal of Research and Development 17, 525-532 (1973)
3. Calude, C., Pǎun, Gh.: Bio-steps beyond Turing. BioSystems 77, 175-194 (2004)
4. Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys. 21, 219-253 (1982)
5. Ibarra, O.H.: On strong reversibility in P systems and related problems (manuscript)
6. Leporati, A., Zandron, C., Mauri, G.: Reversible P systems to simulate Fredkin circuits. Fundam. Inform. 74(4), 529-548 (2006)
7. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
8. Morita, K.: Universality of a reversible two-counter machine. Theoret. Comput. Sci. 168, 303-320 (1996)
9. Morita, K.: A simple reversible logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 102-113. Springer, Heidelberg (2001)
10. Morita, K.: Simple universal one-dimensional reversible cellular automata. J. Cellular Automata 2, 159-165 (2007)
11. Morita, K., Nishihara, N., Yamamoto, Y., Zhang, Zh.: A hierarchy of uniquely parsable grammar classes and deterministic acceptors. Acta Inf. 34(5), 389-410 (1997)
12. Morita, K., Yamaguchi, Y.: A universal reversible Turing machine. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 90-98. Springer, Heidelberg (2007)
13. Pǎun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
14. P systems webpage, http://ppage.psystems.eu/