( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Recognizable Subsets of Free Partially Commutative Monoids.

. Theor. Comput. Sci., (1988)

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.

Yves Steinmetz

Yves Matthess

Yves Hoffmann

Yves Gensterblum

Yves Burkhardt

 

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

Computing trees with graph rewriting systems with priorities., и . Tree Automata and Languages, North-Holland, (1992)Termination Detection of Local Computations, , и . CoRR, (2010)A Characterization of Families of Graphs in Which Election Is Possible., и . FoSSaCS, том 2303 из Lecture Notes in Computer Science, стр. 159-172. Springer, (2002)A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs., и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 212-223. Springer, (2005)Definitions and Comparisons of Local Computations on Graphs., , и . MFCS, том 629 из Lecture Notes in Computer Science, стр. 364-373. Springer, (1992)Coverings and Minors: Application to Local Computations in Graphs., и . Eur. J. Comb., 15 (2): 127-138 (1994)Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.. Theor. Comput. Sci., (1985)On the Recognition of Families of Graphs with Local Computations, , и . Inf. Comput., 118 (1): 110-119 (апреля 1995)Synchronizers for Local Computations., , , и . ICGT, том 3256 из Lecture Notes in Computer Science, стр. 271-286. Springer, (2004)Partial Commutation and Traces., и . Handbook of Formal Languages (3), Springer, (1997)