From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Synchronized Shuffle and Regular Languages.

M. Latteux, и Y. Roos. Jewels are Forever, стр. 35-44. Springer, (1999)

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.

Decomposition of Partial Commutations.M. Clerbout, M. Latteux, и Y. Roos. ICALP, том 443 из Lecture Notes in Computer Science, стр. 501-511. Springer, (1990)Minimal NFA and biRFSA Languages.M. Latteux, Y. Roos, и A. Terlutte. RAIRO Theor. Informatics Appl., 43 (2): 221-237 (2009)Composition of Two Semi Commutations.Y. Roos, и P. Wacrenier. MFCS, том 520 из Lecture Notes in Computer Science, стр. 406-414. Springer, (1991)Partial Characterization of Synchronization Languages.I. Ryl, Y. Roos, и M. Clerbout. MFCS, том 1295 из Lecture Notes in Computer Science, стр. 209-218. Springer, (1997)Monotone AC-Tree Automata.H. Ohsaki, J. Talbot, S. Tison, и Y. Roos. LPAR, том 3835 из Lecture Notes in Computer Science, стр. 337-351. Springer, (2005)About Synchronization Languages.I. Ryl, Y. Roos, и M. Clerbout. MFCS, том 1450 из Lecture Notes in Computer Science, стр. 533-542. Springer, (1998)Synchronization Languages.M. Clerbout, Y. Roos, и I. Ryl. Theor. Comput. Sci., 215 (1-2): 99-121 (1999)A canonical automaton for one-rule length-preserving string rewrite systems.M. Latteux, и Y. Roos. Inf. Comput., (2015)On prefixal one-rule string rewrite systems.M. Latteux, и Y. Roos. Theor. Comput. Sci., (2019)Synchronized Shuffle and Regular Languages.M. Latteux, и Y. Roos. Jewels are Forever, стр. 35-44. Springer, (1999)