Author of the publication

On small, reduced, and fast universal accepting networks of splicing processors.

, , and . Theor. Comput. Sci., 410 (4-5): 406-416 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Uniformly bounded duplication codes., and . RAIRO Theor. Informatics Appl., 41 (4): 411-424 (2007)Dynamical Teams in Eco-Grammar Systems., and . Fundam. Informaticae, 44 (1-2): 83-94 (2000)High Performance and Scalable Simulations of a Bio-inspired Computational Model., , , and . HPCS, page 543-550. IEEE, (2019)Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages., , and . Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 60-67. Springer, (2004)Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages., and . WMP, volume 2235 of Lecture Notes in Computer Science, page 135-146. Springer, (2000)All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size., , and . DNA, volume 4287 of Lecture Notes in Computer Science, page 47-57. Springer, (2006)Accepting Hybrid Networks of Evolutionary Processors., , and . DNA, volume 3384 of Lecture Notes in Computer Science, page 235-246. Springer, (2004)Contextual Information Systems., and . CONTEXT, volume 3554 of Lecture Notes in Computer Science, page 304-315. Springer, (2005)Solving NP-Complete Problems With Networks of Evolutionary Processors., , , and . IWANN (1), volume 2084 of Lecture Notes in Computer Science, page 621-628. Springer, (2001)Valence grammars on a free generated group.. Bulletin of the EATCS, (1992)