Skip to main content

previous disabled Page of 2
and
  1. No Access

    Article

    Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors

    A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evolu...

    Artiom Alhazov, Rudolf Freund, Vladimir Rogozhin, Yurii Rogozhin in Natural Computing (2016)

  2. No Access

    Chapter

    Computational Models Based on Splicing

    In this paper we overview twelve different computational models that use the splicing operation.We explain the methods used for the organization of the computational process in this area and give examples for ...

    Yurii Rogozhin, Sergey Verlan in Automata, Universality, Computation (2015)

  3. No Access

    Article

    Generating and accepting P systems with minimal left and right insertion and deletion

    In this paper we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific varian...

    Rudolf Freund, Yurii Rogozhin, Sergey Verlan in Natural Computing (2014)

  4. No Access

    Book and Conference Proceedings

    Membrane Computing

    14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 20-23, 2013, Revised Selected Papers

    Artiom Alhazov, Svetlana Cojocaru, Marian Gheorghe in Lecture Notes in Computer Science (2014)

  5. No Access

    Chapter and Conference Paper

    P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations

    This work presents a hybrid model of high performance computations, representing the P system framework with additional quantum functionalities. This model is supposed to take advantages of both biomolecular a...

    Yurii Rogozhin, Artiom Alhazov, Lyudmila Burtseva, Svetlana Cojocaru in Membrane Computing (2014)

  6. No Access

    Chapter

    Small Universal Devices

    In this paper we overview several universal universality constructions for different type of devices based on (circular) string rewriting, multiset rewriting and splicing operations. We consider systems that h...

    Artiom Alhazov, Yurii Rogozhin, Sergey Verlan in Computing with New Resources (2014)

  7. No Access

    Chapter and Conference Paper

    Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete

    A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evoluti...

    Artiom Alhazov, Rudolf Freund in Unconventional Computation and Natural Com… (2014)

  8. No Access

    Chapter and Conference Paper

    A P System Parsing Word Derivatives

    This paper describes membrane computational models parsing affixed Romanian words with prefixes, suffixes, terminations, and alterations in the root. An algorithm for Romanian affixes extraction is given, and ...

    Artiom Alhazov, Elena Boian in Unconventional Computation and Natural Com… (2013)

  9. No Access

    Chapter and Conference Paper

    Turing Computability and Membrane Computing

    Alan Turing began a new area in science; he discovered that there are universal computers, which in principal are very simple. Up to now this is the basis of a modern computing theory and practice. In the pape...

    Yurii Rogozhin, Artiom Alhazov in Membrane Computing (2013)

  10. No Access

    Chapter and Conference Paper

    Sequential P Systems with Regular Control

    In this article we introduce the regulating mechanism of control languages for the application of rules assigned to the membranes of a sequential P system and the variant of time-varying sets of rules availabl...

    Artiom Alhazov, Rudolf Freund, Hilbert Heikenwälder, Marion Oswald in Membrane Computing (2013)

  11. No Access

    Chapter and Conference Paper

    P Systems with Minimal Left and Right Insertion and Deletion

    In this article we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific vari...

    Rudolf Freund, Yurii Rogozhin, Sergey Verlan in Unconventional Computation and Natural Com… (2012)

  12. No Access

    Chapter and Conference Paper

    Circular Post Machines and P Systems with Exo-insertion and Deletion

    This paper focuses on P systems with one-symbol insertion and deletion without contexts. The main aim of this paper is to consider the operations applied at the ends of the string, and prove the computational ...

    Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin in Membrane Computing (2012)

  13. No Access

    Article

    Computational power of insertion–deletion (P) systems with rules of size two

    This article investigates insertion–deletion systems of small size, where at most two symbols can be used in the description of insertion or deletion rules in a context-free or contextual manner. The basic res...

    Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan in Natural Computing (2011)

  14. No Access

    Chapter and Conference Paper

    Complete Obligatory Hybrid Networks of Evolutionary Processors

    We consider obligatory hybrid networks of evolutionary processors (OHNEPs) introduced recently. It is a variant of hybrid network of evolutionary processors (HNEPs), differing from the main model as follows: i...

    Artiom Alhazov, Gemma Bel-Enguix in Highlights in Practical Applications of Ag… (2011)

  15. No Access

    Chapter and Conference Paper

    About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution

    In this paper we consider complete obligatory hybrid networks of evolutionary processors (OHNEPs) with insertion and deletion operations (without substitution). Such networks are not computationally complete a...

    Artiom Alhazov, Gemma Bel-Enguix in Advances in Computational Intelligence (2011)

  16. No Access

    Chapter and Conference Paper

    A Small Universal Splicing P System

    In this article we present a universal splicing P system with 6 rules. Thus we improve the previous result that used 8 rules and lower the possible value for the boundary between the universality and non-unive...

    Artiom Alhazov, Yurii Rogozhin, Sergey Verlan in Membrane Computing (2011)

  17. No Access

    Chapter and Conference Paper

    Polymorphic P Systems

    Membrane computing is a formal framework of distributed parallel computing. In this paper we introduce a variant of the multiset rewriting model where the rules of every region are defined by the contents of i...

    Artiom Alhazov, Sergiu Ivanov, Yurii Rogozhin in Membrane Computing (2011)

  18. No Access

    Chapter and Conference Paper

    The Family of Languages Generated by Non-cooperative Membrane Systems

    The aim of this paper is to study the family of languages generated by the transitional membrane systems without cooperation and without additional ingredients. The fundamental nature of these basic systems ma...

    Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin in Membrane Computing (2011)

  19. No Access

    Chapter and Conference Paper

    Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes

    Membrane computing is a formal framework of distributed parallel multiset processing. Due to massive parallelism and exponential space some intractable computational problems can be solved by P systems with ac...

    Artiom Alhazov, Liudmila Burtseva, Svetlana Cojocaru, Yurii Rogozhin in Membrane Computing (2009)

  20. No Access

    Chapter and Conference Paper

    About Universal Hybrid Networks of Evolutionary Processors of Small Size

    A hybrid network of evolutionary processors (an HNEP) is a graph with a language processor, input and output filters associated to each node. A language processor performs one type of point mutations (insertio...

    Artiom Alhazov, Erzsébet Csuhaj-Varjú in Language and Automata Theory and Applicati… (2008)

previous disabled Page of 2