P systems with symport/antiport simulating counter automata

Acta Informatica

Volumn 41, Issue 2-3, 2004, Pages 145-170

  Frisco, Pierluigi ^a   Hoogeboom, Hendrik Jan ^b  

^a UNIVERSITY OF EXETER   (United Kingdom)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ANTIPORTS; COUNTER AUTOMATA; MATRIX GRAMMAR; MEMBRANE COMPUTING; P SYSTEMS;

BIOLOGICAL MEMBRANES; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY; SYNCHRONIZATION; THEOREM PROVING;

AUTOMATA THEORY;

EID: 10844230301     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-004-0154-y     Document Type: Article

References (22)

1. Csuhaj-Varjú, E., Vaszil, G. (2002) P automata or purely communicating accepting P systems. In: Pǎun, G. et al. (eds.) Membrane computing: International workshop, pp. 219-233. Springer, Berlin Heidelberg New York
2. Freund, R., Oswald, M. (2002) P systems with activated/prohibited membrane channels. In: Pǎun, G. et al. (eds.) Membrane computing: International workshop, 261-269. Springer, Berlin Heidelberg New York
3. Freund, R., Oswald, M. (2002) A short note on analysing P systems with antiport rules. Bulletin of the European Association for Theoretical Computer Science 78: 231-236
4. Freund, R., Pǎun, A. (2002) Membrane systems with symport/antiport rules: Universality results. In: Pǎun, G. et al. (eds), Membrane computing: International workshop, pp. 270-287. Springer, Berlin Heidelberg New York
5. Freund, R., Pǎun, G. (2001) On the number of non-terminals in graph-controlled programmed, and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) Machines, computations, and universality: Third International Conference, pp. 214-225. Springer, Berlin Heidelberg New York
6. Frisco, P., Hoogeboom, H.J. (2002) Simulating counter automata by P systems with symport/antiport. In: Pǎun, G. et al. (eds.) Membrane computing: International workshop, pp. 288-301. Springer, Berlin Heidelberg New York
7. Hoogeboom, H.J. (2002) Carriers and counters. P-systems with carriers vs. (blind) counter automata. In: Ito, M., Toyama, M. (eds.) Developments in language theory. 6th International conference, DLT 2002. Kyoto, Japan, September 2002. Revised papers, vol. 2450 (Lecture Notes in Computer Science), pp. 140-151
8. Hopcroft, J.E., Ullman, D. (1979) Introduction to automata theory, languages, and computation. Addison-Wesley
9. Ionescu, M., Martín-Vide, C., Pǎun, A., Pǎun, G. (2002) Unexpected universality results for three classes of P systems with symport/antiport, vol. 2568 (Lecture Notes in Computer Science), pp. 281-290. Hokkaido University, Springer, Berlin Heidelberg New York
10. Margenstern, M., Rogozhin, Y. (eds.) (2001) Machines, computations, and universality: Third International Conference. MCU 2001 Chisinau, Moldavia, May 23-27, 2001, Proceedings, vol. 2055 (Lecture Notes in Computer Science). Springer, Berlin Heidelberg New York
11. Martín-Vide, C., Pǎun, A., Pǎun, G. (2002) Membrane computing: New results, new problems. Bulletin of the European Association for Theoretical Computer Science 78: 204-212
12. Martín-Vide, C., Pǎun, A., Pǎun, G. (2002) On the power of P systems with symport rules. The Journal of Universal Computer Science 8: 317-331
13. Martín-Vide, C, Pǎun, A., Pǎun, G., Rozenberg, G. (2002) Membrane systems with coupled transport: universality and normal forms. Fundamenta Informaticae 49: 1-15
14. Martín-Vide, C., Pǎun, G. (2001) Computing with membranes (P systems): Universality results. In: Margenstern, M., Rogozhin, Y. (eds.) Machines, computations, and universality: Third International Conference, pp. 82-101. Springer, Berlin Heidelberg New York
15. Minsky, M.L. (1961) Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Annals of Mathematics 74(3): 437-455
16. Pǎun, A., Pǎun, G. (2002) The power of communication: P systems with symport/antiport. New Generation Computing 20(3): 295-306
17. Pǎun, G. (2000) Computing with membranes. Journal of Computer and System Sciences 1(61): 108-143
18. Pǎun, G. (2000) Computing with membranes (P systems): twenty six research topics. TR 140, CDMTCS, pp. 203-217. University of Auckland, New Zealand
19. Pǎun, G. (2002) Membrane computing. An introduction. Springer, Berlin Heidelberg New York
20. Pǎun, G., Rozenberg, G. (2002) A guide to membrane computing. Theoretical Computer Science 287: 73-100
21. Pǎun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) (2002) Membrane computing: International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002. Revised Papers, vol. 2597 (Lecture Notes in Computer Science).
22. Sosík, P., Freund, R. (2002) P systems without priorities are computationally universal. In: Pǎun, G. et al. (eds.), Membrane computing: International Workshop, pp. 400-409. Springer, Berlin Heidelberg New York