Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Sevilla Carpets Revisited : Enriching the Membrane Computing Toolbox

Orellana-Martín D., Graciani C., Macías-Ramos L.-F., Martínez-del-Amor M. A., Riscos-Núñez A., Romero-Jiménez A., Valencia-Cabrera L.

Fundamenta Informaticae

2014

Vol. 134, nr 1/2

153--166

Sevilla carpets have already been used to compare different solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets in this context, and a script that allows to generate them automatically from P-Lingua files.

Simulating Turing Machines by P Systems with External Output

Romero-Jiménez A., Pérez-Jiménez M.J.

Fundamenta Informaticae

2002

Vol. 49, nr 1-3

273-287

In [3] a variant of the computation model introduced by Gh. Pun in [1] is considered: membrane systems with external output, which were proven to be universal, in the sense that they are able to generate all Parikh images of recursively enumerable languages. Here we give another proof of the universality of this model. The proof is carried out associating to each deterministic Turing machine a P system with external output that simulates its running. Thus, although we work with symbol-objects, we get strings as a result of computations, and in this way we generate directly all recursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3].