( en | de | ru )

 

Disambiguation of "Rogozhin, Yurii"

Author of the publication

copydeleteadd this publication to your clipboard
Self-describing Turing machines.

, and . Fundam. Informaticae, 50 (3-4): 285-303 (2002)

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.

Yurii Bilodid

Alexander Rogozhin

 

Other publications of authors with the same name

Investigations on Natural Computing in the Institute of Mathematics and Computer Science., , , , , , , , , and 6 other author(s). Comput. Sci. J. Moldova, 18 (2): 101-138 (2010)Generating Languages by P Systems with Minimal Symport/Antiport., and . Comput. Sci. J. Moldova, 14 (3): 299-323 (2006)Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages., and . Where Mathematics, Computer Science, Linguistics and Biology Meet, page 399-407. Kluwer Academic Publishers, (2001)About Universal Hybrid Networks of Evolutionary Processors of Small Size., , , and . LATA, volume 5196 of Lecture Notes in Computer Science, page 28-39. Springer, (2008)A Universal Time-Varying Distributed H System of Degree 1., and . DNA, volume 2340 of Lecture Notes in Computer Science, page 371-380. Springer, (2001)Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete., , and . UCNC, volume 8553 of Lecture Notes in Computer Science, page 1-13. Springer, (2014)One-membrane symport with few extra symbols., and . Int. J. Comput. Math., 90 (4): 750-759 (2013)Dictionary Search and Update by P Systems with String-Objects and Active Membranes., , , and . Int. J. Comput. Commun. Control, 4 (3): 206-213 (2009)About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution., , , and . IWANN (1), volume 6691 of Lecture Notes in Computer Science, page 441-448. Springer, (2011)A Universal Turing Machine with 3 States and 9 Symbols., and . Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, page 311-318. Springer, (2001)