Searching for authors named Gheorghe Paun – sorted by Relevance.
32 documents found, showing 1 through 10.
Next 10 →
-
Computing with Membranes: A Variant
- …CDMTCS Research Report Series Computing with Membranes: A Variant Gheorghe Paun Institute…
- Cited by 3 (0 self) – Add To MetaCart
-
P Systems with Active Membranes: Attacking NP Complete Problems
- … Gheorghe PAUN Institute of Mathematics of the Romanian Academy, Bucuresti, Romania CDMTCS-102 May 1999…
- Cited by 23 (1 self) – Add To MetaCart
-
DNA Computing Based on Splicing: Universality Results
- …CDMTCS Research Report Series DNA Computing Based on Splicing: Universality Results Gheorghe P#aun…
- Cited by 9 (0 self) – Add To MetaCart
-
Two-Level Distributed H Systems
- …CDMTCS Research Report Series Two-Level Distributed H Systems Gheorghe P#aun Institute…
- Cited by 1 (0 self) – Add To MetaCart
-
From DNA Recombination to DNA Computing Via Formal Languages
- …From DNA Recombination to DNA Computing Via Formal Languages Gheorghe Paun Institute…
- Cited by 1 (0 self) – Add To MetaCart
-
Cooperating Distributed Splicing Systems
- … Virgili University Gheorghe P#aun Institute of Mathematics of the Romanian Academy CDMTCS-071 December…
- Add To MetaCart
-
On Synchronization in P Systems
- …. The P systems were recently introduced as distributed parallel computing models of a biochemical type. Multisets of objects are placed in a hierarchical structure of membranes and they evolve according to given rules, which are applied in a synchronous manner: at each step, all objects which c…
- Add To MetaCart
-
Membrane Computing with External Output
- …A super-cell system consists of computing cells which are organized hierarchically by the inclusion relation: cells may include cells, which again may include cells, etc. Each cell is enclosed by its membrane. Each cell is an independent computing agent with its own computing program, which produces…
- Cited by 8 (1 self) – Add To MetaCart
-
At the Crossroads of Linguistics, DNA Computing, and Formal Language Theory: Characterizing RE Using Insertion-Deletion Systems
- …. Several characterizations of recursively enumerable (RE) languages are presented, using insertion-deletion systems. Such a system generates the elements of a language by inserting and deleting words, according to their contexts (the insertiondeletion rules are triples (u; z; v), with the meaning t…
- Add To MetaCart
-
Modeling Coordination by Means of Operations on Strings and on Derivation Trees
- …'in-Vide Gheorghe Paun yz Abstract Several operations on strings are introduced, as models of the phenomenon…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
