( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back.

, , , , , , и . WORDS, том 12847 из Lecture Notes in Computer Science, стр. 50-64. Springer, (2021)

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.

Rania Dayoub

Peter Day

Naina Daya

Janeth Norfleete Day

Dominic Day

 

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

k-Spectra of c-Balanced Words., , , и . CoRR, (2019)k-Spectra of Weakly-c-Balanced Words., , , и . DLT, том 11647 из Lecture Notes in Computer Science, стр. 265-277. Springer, (2019)Word Equations in the Context of String Solving.. DLT, том 13257 из Lecture Notes in Computer Science, стр. 13-32. Springer, (2022)The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability., , , , и . CoRR, (2018)Local Patterns., , , и . FSTTCS, том 93 из LIPIcs, стр. 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On Matching Generalised Repetitive Patterns., , , , и . DLT, том 11088 из Lecture Notes in Computer Science, стр. 269-281. Springer, (2018)Rule-based Word Equation Solving., , , , и . FormaliSE@ICSE, стр. 87-97. ACM, (2020)On the Structure of Solution Sets to Regular Word Equations., и . ICALP, том 168 из LIPIcs, стр. 124:1-124:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Satisfiability of Word Equations: Decidable and Undecidable Theories., , , , и . RP, том 11123 из Lecture Notes in Computer Science, стр. 15-29. Springer, (2018)Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number., , , , , и . ICALP, том 132 из LIPIcs, стр. 109:1-109:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)