Undecidability and Computational Completeness for P Systems with One- and Two-dimensional Array Insertion and Deletion Rules
Close
Articolul precedent
Articolul urmator
778 3
Ultima descărcare din IBN:
2018-10-13 22:28
SM ISO690:2012
FERNAU, Henning, FREUND, Rudolf, IVANOV, Sergiu, OSWALD, Marion, SCHMID, Markus L, SUBRAMANIAN, K.G.. Undecidability and Computational Completeness for P Systems with One- and Two-dimensional Array Insertion and Deletion Rules. In: International Conference on Membrane Computing, 20-23 august 2013, Chișinău. Chișinău: "VALINEX" SRL, 2013, pp. 309-312. ISBN 978-9975-4237-2-4.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
International Conference on Membrane Computing 2013
Conferința "International Conference on Membrane Computing"
Chișinău, Moldova, 20-23 august 2013

Undecidability and Computational Completeness for P Systems with One- and Two-dimensional Array Insertion and Deletion Rules


Pag. 309-312

Fernau Henning1, Freund Rudolf2, Ivanov Sergiu3, Oswald Marion2, Schmid Markus L1, Subramanian K.G.4
 
1 Universit¨at Trier,
2 Technische Universität Wien, Institut für Computersprachen,
3 Université Paris-Est-Créteil,
4 Universiti Sains Malaysia
 
 
Disponibil în IBN: 2 iulie 2018