( en | de | ru )

 

Disambiguation of "Blanchet-Sadri, Francine"

Author of the publication

copydeleteadd this publication to your clipboard
Computing abelian complexity of binary uniform morphic words.

, , and . Theor. Comput. Sci., (2016)

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.

Reza Sadri

Steve Blanchet

Mehdi Sadri

Thomas Blanchet

Keyvan Sadri

 

Other publications of authors with the same name

Erratum to: Avoidable binary patterns in partial words., , , and . Acta Inf., 49 (1): 53-54 (2012)Computing the Partial Word Avoidability Indices of Ternary Patterns., , and . IWOCA, volume 7643 of Lecture Notes in Computer Science, page 206-218. Springer, (2012)Correlations of Partial Words., , and . STACS, volume 4393 of Lecture Notes in Computer Science, page 97-108. Springer, (2007)Partial Word DFAs., , , and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 36-47. Springer, (2013)How Many Holes Can an Unbordered Partial Word Contain?., , , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 176-187. Springer, (2009)Computing generalized de Bruijn sequences., and . Theor. Comput. Sci., (2017)Computing longest common extensions in partial words., and . Discret. Appl. Math., (2018)New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings., , and . STACS, volume 25 of LIPIcs, page 162-173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Border Correlations of Partial Words., , and . Theory Comput. Syst., 47 (1): 179-195 (2010)Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods., , and . Int. J. Found. Comput. Sci., 21 (5): 705-722 (2010)