Partial Versus Total Halting in P Systems
Închide
Articolul precedent
Articolul urmator
286 0
SM ISO690:2012
ALHAZOV, Artiom, FREUND, Rudolf, OSWALD, Marion, VERLAN, Sergey. Partial Versus Total Halting in P Systems. In: Brainstorming Week on Membrane Computing, 29 ianuarie - 2 februarie 2007, Sevilla. Sevilla, Spania: Fénix Editora, 2007, Ediția a 5-a, pp. 1-20. ISBN 978-84-611-6776-0.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Brainstorming Week on Membrane Computing
Ediția a 5-a, 2007
Masa rotundă "Fifth Brainstorming Week on Membrane Computing"
Sevilla, Spania, 29 ianuarie - 2 februarie 2007

Partial Versus Total Halting in P Systems


Pag. 1-20

Alhazov Artiom12, Freund Rudolf3, Oswald Marion3, Verlan Sergey4
 
1 Abo Akademi University, Turku, Finland,
2 Institute of Mathematics and Computer Science ASM,
3 Vienna University of Technology,
4 University of Paris 12 Val-de-Marne
 
 
Disponibil în IBN: 16 mai 2021


Rezumat

We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems working in different derivation modes.