Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2002 | Vol. 49, nr 1-3 | 103-122
Tytuł artykułu

A Direct Construction of a Universal P System

Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of another P system. Previous results were based on the simulation of universal type-0 grammars or Turing machines. We think that the approach we use can be applied to other variants of P systems.
Słowa kluczowe
Wydawca

Rocznik
Strony
103-122
Opis fizyczny
bibliogr. 14 poz.
Twórcy
autor
autor
  • L.I.A.C.S., Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands, pier@liacs.nl
Bibliografia
  • [1] J. Castellanos, Gh. P2un, A. Rodriguez-Paton, P Systems with worm objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64-74.
  • [2] P. Frisco, A direct construction of a universal extended H system, Proc. Third. Intern. Conf. on Universal Machines and Computations, ChięinSu, Moldova, 2001, Lećt. Notes in Computer Science, 2055 (M. Margen-stem, Y. Rogozhin, eds.), Springer-Verlag, 2001,226-239.
  • [3] P. Frisco, On two variants of splicing super-cell systems, Workshop on Multiset Processing, Curtea de Arges, Romania, August 2000; Romanian Journal of Information Science and Technology, 4, 1-2 (2001), 89-100.
  • [4] T. Head, Forma! language theory and DNA; an analysis of the generative capacity of specific recombinant behaviors, Buli. Math. Biology, 49 (1987), 737-759.
  • [5] M. Madhu, K Krithivasan, P systems with active objects: Universality and efficiency, Proc. Third. Intern.
  • Conf. on Universal Machines and Computations, Chi§in3u, Moldova, 2001, Lect. Notes in Computer Science, 2055 (M. Margenstem, Y. Rogozhin, eds.), Springer-Verlag, 2001,276-287.
  • [6] C. Martin-Vide, V. Mitrana, P systems with valuations, Uncomentional Models of Computation, Proc. UMC’2K (I. Antoniou, C.S. Calude and M. J. Dinneen, eds.), Springer Verlag, London, December 2000, 154-166.
  • [7] A. P2un, M. P2un, On membranę computing based on splicing, in vol. Where Mathematics, Computer Sci¬ence, Linguistics, and Biology Meet (C. Martin-Vide, V. Mitrana, eds.), Kluwer, Dordrecht, 2001,409-422.
  • [8] Gh. P2un, Regular extended H systems are computationally universal, J. Automata, Languages, Combina-torics, 1,1 (1996), 27-36.
  • [9] Gh. P2un, Computing with membranes, Journal of Computer and System Sciences, 61 (2000), 108-143 and also Turku Centre for Computer Science-TUCS Report No. 208,1998 http://www.tucs.fi.
  • [10] Gh. P2un, Computing with membranes. An introduction, Bulletin of the EATCS, 67 (Febr. 1999), 139-152.
  • [11] Gh. P2un, Computing with membranes - A variant: P systems with polarized membranes, Inter. J. of Foun-dations of Computer Science, 11,1 (2000), 167-182.
  • [12] Gh. P2un, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
  • [13] Gh. P2un, T. Yokomori, Membranę computing based on splicing, Preliminary Proc, of Fifth Intern. Meeting on DNA Based Computers (E. Winfree, D. Gifford, eds.), MIT, June 1999, 213-227. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 54, American Mathematical Society, 2000, 217-232.
  • [14] P systems web page: http://bioinformatics.bio.discoEunimib.it/psystems/.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0003-0104
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.