( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tilings: simulation and universality.

, и . Math. Struct. Comput. Sci., 20 (5): 813-850 (2010)

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.

Grégory Nain

Grégory Païs

Grégory Mallet

Grégory Smits

Grégory Batt

 

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

A Topological Study of Tilings., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 375-387. Springer, (2008)The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory., и . MFCS, том 1893 из Lecture Notes in Computer Science, стр. 508-517. Springer, (2000)On Randomness and Infinity.. IFIP TCS, том 223 из IFIP Conference Proceedings, стр. 267-279. Kluwer, (2002)How Powerful Are Infinite Time Machines?. FCT, том 2138 из Lecture Notes in Computer Science, стр. 252-263. Springer, (2001)Computability of Tilings., и . IFIP TCS, том 273 из IFIP, стр. 187-201. Springer, (2008)Tilings: simulation and universality., и . Math. Struct. Comput. Sci., 20 (5): 813-850 (2010)An algorithmic approach to characterizations of admissibles., и . CiE, том 11558 из Lecture Notes in Computer Science, стр. 181-192. Springer, (2019)Constructing New Aperiodic Self-simulating Tile Sets., и . CiE, том 5635 из Lecture Notes in Computer Science, стр. 300-309. Springer, (2009)Universal Tilings., и . STACS, том 4393 из Lecture Notes in Computer Science, стр. 367-380. Springer, (2007)An Almost Totally Universal Tile Set., и . TAMC, том 5532 из Lecture Notes in Computer Science, стр. 271-280. Springer, (2009)