The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We first give a historical overview of the most important results obtained in the area of P systems and tissue P systems with symport/antiport rules, especially with respect to the development of computational completeness results improving descriptional complexity parameters. We consider the number of membranes (cells in tissue P systems), the weight of the rules, and the number of objects. Then...
The paper formally describes an operational semantics of P systems. We present an abstract syntax of P systems, then the notion of configurations, and we define the sets of inference rules corresponding to the three stages of an evolution step: maximal parallel rewriting, parallel communication, and parallel dissolving. Several results assuring the correctness of each set of inference rules are also...
We consider P systems that are used as acceptors (recognizers). In the standard semantics of P systems, each evolution step is a result of applying all the rules in a maximally parallel manner: at each step, a maximal multiset of rules are nondeterministically selected and applied in parallel to the current configuration to derive the next configuration (thus, the next configuration is not unique,...
A new type of approximate algorithms for optimization problems, called membrane algorithms, is proposed, which can be seen as an application of membrane computing to evolutionary computing. A membrane algorithm consists of several membrane separated regions, where subalgorithms and tentative solutions to the optimization problem to be solved are placed, as well as a solution transporting mechanism...
We introduce a simple model of P system motivated by certain restrictions found in biological systems. Its computational power is rather limited and corresponds to that of a finite transducer. An important characteristics of the model is its interactive behavior. Then we study the computational power of evolutionary lineages of such P systems. Referring to known results from the structural complexity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.