( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes.

, , и . Fundam. Informaticae, 58 (2): 67-77 (2003)

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.

Artiom Riabikhin

 

Другие публикации лиц с тем же именем

When catalytic P systems with one catalyst can be computationally complete., , и . J. Membr. Comput., 3 (3): 170-181 (2021)Universality of 2-State 3-Symbol Reversible Logic Elements - A Direct Simulation Method of a Rotary Element., , , и . IWNC, том 2 из Proceedings in Information and Communications Technology, стр. 252-259. Springer, (2009)About Universal Hybrid Networks of Evolutionary Processors of Small Size., , , и . LATA, том 5196 из Lecture Notes in Computer Science, стр. 28-39. Springer, (2008)Bridging Deterministic P Systems and Conditional Grammars., , и . Int. Conf. on Membrane Computing, том 9504 из Lecture Notes in Computer Science, стр. 63-76. Springer, (2015)Polarizationless P Systems with One Active Membrane., и . Int. Conf. on Membrane Computing, том 9504 из Lecture Notes in Computer Science, стр. 51-62. Springer, (2015)Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete., , и . UCNC, том 8553 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2014)Solving HPP and SAT by P Systems with Active Membranes and Separation Rules., и . Acta Informatica, 43 (2): 131-145 (2006)One-membrane symport with few extra symbols., и . Int. J. Comput. Math., 90 (4): 750-759 (2013)Variants of P systems with activation and blocking of rules., , и . Nat. Comput., 18 (3): 593-608 (2019)Length P Systems., , и . Fundam. Informaticae, 134 (1-2): 17-37 (2014)