Blanchet-Sadri, Francine; Chen, Kun; Hawes, Kenneth Dyck words, lattice paths, and abelian borders. (English) Zbl 07726982 Int. J. Found. Comput. Sci. 33, No. 3-4, 203-226 (2022). Reviewer: Michel Rigo (Liège) MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Int. J. Found. Comput. Sci. 33, No. 3--4, 203--226 (2022; Zbl 07726982) Full Text: DOI
Blanchet-Sadri, F.; Osborne, S. Computing longest common extensions in partial words. (English) Zbl 1393.68136 Discrete Appl. Math. 246, 119-139 (2018). Reviewer: Mikhail Volkov (Ekaterinburg) MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Osborne}, Discrete Appl. Math. 246, 119--139 (2018; Zbl 1393.68136) Full Text: DOI
Blanchet-Sadri, F.; Lazarow, J.; Nikkel, J.; Quigley, J. D.; Zhang, X. Computing primitively-rooted squares and runs in partial words. (English) Zbl 1380.68317 Eur. J. Comb. 68, 223-241 (2018). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Eur. J. Comb. 68, 223--241 (2018; Zbl 1380.68317) Full Text: DOI
Blanchet-Sadri, F.; Cordier, M.; Kirsch, R. Border correlations, lattices, and the subgraph component polynomial. (English) Zbl 1373.05002 Eur. J. Comb. 68, 204-222 (2018). MSC: 05A05 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Eur. J. Comb. 68, 204--222 (2018; Zbl 1373.05002) Full Text: DOI
Blanchet-Sadri, F.; Osborne, S. Constructing words with high distinct square densities. (English) Zbl 1483.68269 Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 71-85 (2017). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Osborne}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 71--85 (2017; Zbl 1483.68269) Full Text: arXiv Link
Blanchet-Sadri, F.; Chen, Kun; Hawes, Kenneth Dyck words, lattice paths, and abelian borders. (English) Zbl 1485.68203 Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 56-70 (2017). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 56--70 (2017; Zbl 1485.68203) Full Text: arXiv Link
Becker, Joey; Blanchet-Sadri, F.; Flapan, Laure; Watkins, Stephen Unavoidable sets of partial words of uniform length. (English) Zbl 1483.68268 Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 26-40 (2017). MSC: 68R15 PDFBibTeX XMLCite \textit{J. Becker} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 26--40 (2017; Zbl 1483.68268) Full Text: arXiv Link
Black, Kevin; Blanchet-Sadri, Francine; Coley, Ian; Woodhouse, Brent; Zemke, Andrew Pattern avoidance in partial words dense with holes. (English) Zbl 1390.68510 J. Autom. Lang. Comb. 22, No. 4, 209-241 (2017). Reviewer: Francesco Dolce (Montréal) MSC: 68R15 PDFBibTeX XMLCite \textit{K. Black} et al., J. Autom. Lang. Comb. 22, No. 4, 209--241 (2017; Zbl 1390.68510) Full Text: DOI
Blanchet-Sadri, Francine; Goldner, K.; Shackleton, A. Minimal partial languages and automata. (English) Zbl 1382.68185 RAIRO, Theor. Inform. Appl. 51, No. 2, 99-119 (2017). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., RAIRO, Theor. Inform. Appl. 51, No. 2, 99--119 (2017; Zbl 1382.68185) Full Text: DOI Link
Blanchet-Sadri, F.; Munteanu, Sinziana Computing generalized de Bruijn sequences. (English) Zbl 1390.68511 Theor. Comput. Sci. 704, 42-61 (2017). Reviewer: Francesco Dolce (Montréal) MSC: 68R15 68Q25 68R10 68W32 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Munteanu}, Theor. Comput. Sci. 704, 42--61 (2017; Zbl 1390.68511) Full Text: DOI
Blanchet-Sadri, F.; Bodnar, Michelle; De Winkle, Benjamin New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. (English) Zbl 1366.68222 Theory Comput. Syst. 60, No. 3, 473-497 (2017). MSC: 68R15 05C69 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theory Comput. Syst. 60, No. 3, 473--497 (2017; Zbl 1366.68222) Full Text: DOI Link
Blanchet-Sadri, Francine; Chakarov, Aleksandar; Chen, Bob; Manuelli, Lucas; Munteanu, Sinziana; Schwartz, Jarett; Stich, Slater Recurrent partial words and representable sets. (English) Zbl 1380.68318 J. Autom. Lang. Comb. 21, No. 3, 149-181 (2016). Reviewer: Francesco Dolce (Montréal) MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Autom. Lang. Comb. 21, No. 3, 149--181 (2016; Zbl 1380.68318) Full Text: DOI
Blanchet-Sadri, F.; Lohr, Andrew Computing depths of patterns. (English) Zbl 1359.68237 RAIRO, Theor. Inform. Appl. 50, No. 2, 117-133 (2016). Reviewer: Anton Černý (Safat) MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. Lohr}, RAIRO, Theor. Inform. Appl. 50, No. 2, 117--133 (2016; Zbl 1359.68237) Full Text: DOI
Blanchet-Sadri, F.; Seita, Daniel; Wise, David Computing abelian complexity of binary uniform morphic words. (English) Zbl 1352.68198 Theor. Comput. Sci. 640, 41-51 (2016). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 68R15 11B85 68Q45 68W32 68W40 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 640, 41--51 (2016; Zbl 1352.68198) Full Text: DOI
Blanchet-Sadri, Francine; Harred, Rachel; Lazarow, Justin Longest common extensions in partial words. (English) Zbl 1393.68137 Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-29515-2/pbk; 978-3-319-29516-9/ebook). Lecture Notes in Computer Science 9538, 52-64 (2016). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 9538, 52--64 (2016; Zbl 1393.68137) Full Text: DOI
Allen, Emily; Blanchet-Sadri, F.; Bodnar, Michelle; Bowers, Brian; Hidakatsu, Joe; Lensmire, John Combinatorics on partial word borders. (English) Zbl 1347.68287 Theor. Comput. Sci. 609, Part 2, 469-493 (2016). Reviewer: Wolfgang Steiner (Sydney) MSC: 68R15 PDFBibTeX XMLCite \textit{E. Allen} et al., Theor. Comput. Sci. 609, Part 2, 469--493 (2016; Zbl 1347.68287) Full Text: DOI
Blanchet-Sadri, Francine; Rashin, Abraham Squareable words. (English) Zbl 1434.68377 Potapov, Igor (ed.), Developments in language theory. 19th international conference, DLT 2015, Liverpool, UK, July 27–30, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9168, 132-142 (2015). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. Rashin}, Lect. Notes Comput. Sci. 9168, 132--142 (2015; Zbl 1434.68377) Full Text: DOI
Blanchet-Sadri, Francine; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan Computing primitively-rooted squares and runs in partial words. (English) Zbl 1380.68319 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 86-97 (2015). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 8986, 86--97 (2015; Zbl 1380.68319) Full Text: DOI
Blanchet-Sadri, Francine; Lohr, Andrew Computing minimum length representations of sets of words of uniform length. (English) Zbl 1396.68082 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 74-85 (2015). MSC: 68R15 68W32 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. Lohr}, Lect. Notes Comput. Sci. 8986, 74--85 (2015; Zbl 1396.68082) Full Text: DOI
Blanchet-Sadri, Francine; Cordier, Michelle; Kirsch, Rachel Border correlations, lattices, and the subgraph component polynomial. (English) Zbl 1396.05004 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 62-73 (2015). MSC: 05A05 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 8986, 62--73 (2015; Zbl 1396.05004) Full Text: DOI
Blanchet-Sadri, F.; Lohr, Andrew Computing minimum length representations of sets of words of uniform length. (English) Zbl 1328.68322 Theor. Comput. Sci. 596, 41-54 (2015). MSC: 68W32 68R10 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. Lohr}, Theor. Comput. Sci. 596, 41--54 (2015; Zbl 1328.68322) Full Text: DOI
Blanchet-Sadri, F.; Bodnar, Michelle; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan Squares and primitivity in partial words. (English) Zbl 1311.05087 Discrete Appl. Math. 185, 26-37 (2015). MSC: 05C31 05A15 68R15 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Discrete Appl. Math. 185, 26--37 (2015; Zbl 1311.05087) Full Text: DOI
Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad On the asymptotic abelian complexity of morphic words. (English) Zbl 1371.68220 Adv. Appl. Math. 61, 46-84 (2014). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Adv. Appl. Math. 61, 46--84 (2014; Zbl 1371.68220) Full Text: DOI
Blanchet-Sadri, Francine; Bodnar, Michelle; De Winkle, Benjamin New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. (English) Zbl 1359.68238 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 162-173 (2014). MSC: 68R15 05C69 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 162--173 (2014; Zbl 1359.68238) Full Text: DOI
Blanchet-Sadri, F.; De Winkle, Benjamin; Simmons, Sean Abelian pattern avoidance in partial words. (English) Zbl 1297.68190 RAIRO, Theor. Inform. Appl. 48, No. 3, 315-339 (2014). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., RAIRO, Theor. Inform. Appl. 48, No. 3, 315--339 (2014; Zbl 1297.68190) Full Text: DOI Link
Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\). (English) Zbl 1285.68128 Integers 14, Paper A11, 17 p. (2014). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Integers 14, Paper A11, 17 p. (2014; Zbl 1285.68128) Full Text: EMIS
Blanchet-Sadri, Francine; Lohr, Andrew; Simmons, Sean; Woodhouse, Brent Computing depths of patterns. (English) Zbl 1407.68379 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8370, 173-185 (2014). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 8370, 173--185 (2014; Zbl 1407.68379) Full Text: DOI
Blanchet-Sadri, F.; Jiao, Yang; Machacek, John M.; Quigley, J. D.; Zhang, Xufan Squares in partial words. (English) Zbl 1359.68236 Theor. Comput. Sci. 530, 42-57 (2014). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 530, 42--57 (2014; Zbl 1359.68236) Full Text: DOI
Blanchet-Sadri, F.; Chen, Bob; Munteanu, Sinziana Recurrence in infinite partial words. (English) Zbl 1285.68127 Theor. Comput. Sci. 524, 41-47 (2014). MSC: 68R15 03D40 03D20 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 524, 41--47 (2014; Zbl 1285.68127) Full Text: DOI
Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane Computing the partial word avoidability indices of ternary patterns. (English) Zbl 1334.68167 J. Discrete Algorithms 23, 119-142 (2013). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 23, 119--142 (2013; Zbl 1334.68167) Full Text: DOI
Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane Computing the partial word avoidability indices of binary patterns. (English) Zbl 1334.68166 J. Discrete Algorithms 23, 113-118 (2013). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 23, 113--118 (2013; Zbl 1334.68166) Full Text: DOI
Blanchet-Sadri, F.; Simmons, Sean Counting minimal semi-Sturmian words. (English) Zbl 1311.68126 Discrete Appl. Math. 161, No. 18, 2851-2861 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Simmons}, Discrete Appl. Math. 161, No. 18, 2851--2861 (2013; Zbl 1311.68126) Full Text: DOI
Blanchet-Sadri, Francine; Simmons, Sean; Tebbe, Amelia; Veprauskas, Amy Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. (English) Zbl 1307.68059 RAIRO, Theor. Inform. Appl. 47, No. 3, 215-234 (2013). Reviewer: Jeffrey Shallit (Waterloo) MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., RAIRO, Theor. Inform. Appl. 47, No. 3, 215--234 (2013; Zbl 1307.68059) Full Text: DOI Link
Blanchet-Sadri, Francine; Munteanu, Sinziana Deciding representability of sets of words of equal length in polynomial time. (English) Zbl 1407.68380 Lecroq, Thierry (ed.) et al., Combinatorial algorithms. 24th international workshop, IWOCA 2013, Rouen, France, July 10–12, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8288, 28-40 (2013). MSC: 68R15 68Q25 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Munteanu}, Lect. Notes Comput. Sci. 8288, 28--40 (2013; Zbl 1407.68380) Full Text: DOI
Blanchet-Sadri, F.; Woodhouse, Brent Strict bounds for pattern avoidance. (English) Zbl 1301.68209 Theor. Comput. Sci. 506, 17-28 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{B. Woodhouse}, Theor. Comput. Sci. 506, 17--28 (2013; Zbl 1301.68209) Full Text: DOI Link
Blanchet-Sadri, F.; Fox, Nathan Abelian-primitive partial words. (English) Zbl 1296.68114 Theor. Comput. Sci. 485, 16-37 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{N. Fox}, Theor. Comput. Sci. 485, 16--37 (2013; Zbl 1296.68114) Full Text: DOI
Blanchet-Sadri, Francine; Woodhouse, Brent Strict bounds for pattern avoidance. (English) Zbl 1381.68229 Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 106-117 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{B. Woodhouse}, Lect. Notes Comput. Sci. 7907, 106--117 (2013; Zbl 1381.68229) Full Text: DOI Link
Blanchet-Sadri, Francine; Fox, Nathan On the asymptotic abelian complexity of morphic words. (English) Zbl 1381.68228 Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 94-105 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{N. Fox}, Lect. Notes Comput. Sci. 7907, 94--105 (2013; Zbl 1381.68228) Full Text: DOI
Blanchet-Sadri, Francine; Chen, Bob; Munteanu, Sinziana A note on constructing infinite binary words with polynomial subword complexity. (English) Zbl 1266.68146 RAIRO, Theor. Inform. Appl. 47, No. 2, 195-199 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., RAIRO, Theor. Inform. Appl. 47, No. 2, 195--199 (2013; Zbl 1266.68146) Full Text: DOI Link
Blanchet-Sadri, Francine; Lazarow, Justin Suffix trees for partial words and the longest common compatible prefix problem. (English) Zbl 1377.68326 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 7th international conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37063-2/pbk). Lecture Notes in Computer Science 7810, 165-176 (2013). MSC: 68W32 68P05 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{J. Lazarow}, Lect. Notes Comput. Sci. 7810, 165--176 (2013; Zbl 1377.68326) Full Text: DOI
Blanchet-Sadri, Francine; Bodnar, Michelle; Fox, Nathan; Hidakatsu, Joe A graph polynomial approach to primitivity. (English) Zbl 1377.68190 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 7th international conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37063-2/pbk). Lecture Notes in Computer Science 7810, 153-164 (2013). MSC: 68R15 05C31 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 7810, 153--164 (2013; Zbl 1377.68190) Full Text: DOI
Blanchet-Sadri, F.; Simmons, Sean Deciding representability of sets of words of equal length. (English) Zbl 1293.68158 Theor. Comput. Sci. 475, 34-46 (2013). Reviewer: Anton Cerny (Safat) MSC: 68Q25 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Simmons}, Theor. Comput. Sci. 475, 34--46 (2013; Zbl 1293.68158) Full Text: DOI
Blanchet-Sadri, Francine; Lohr, Andrew; Scott, Shane Computing the partial word avoidability indices of ternary patterns. (English) Zbl 1293.68208 Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 206-218 (2012). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 7643, 206--218 (2012; Zbl 1293.68208) Full Text: DOI Link
Blanchet-Sadri, F. Algorithmic combinatorics on partial words. (English) Zbl 1266.68145 Int. J. Found. Comput. Sci. 23, No. 6, 1189-1206 (2012). MSC: 68R15 68P30 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Int. J. Found. Comput. Sci. 23, No. 6, 1189--1206 (2012; Zbl 1266.68145) Full Text: DOI
Blanchet-Sadri, F.; Mandel, Travis; Sisodia, Gautam Periods in partial words: an algorithm. (English) Zbl 1279.68279 J. Discrete Algorithms 16, 113-128 (2012). MSC: 68R15 68Q45 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 16, 113--128 (2012; Zbl 1279.68279) Full Text: DOI
Blanchet-Sadri, Francine; Simmons, Sean Deciding representability of sets of words of equal length. (English) Zbl 1304.68141 Kutrib, Martin (ed.) et al., Descriptional complexity of formal systems. 14th international workshop, DCFS 2012, Braga, Portugal, July 23–25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31622-7/pbk). Lecture Notes in Computer Science 7386, 103-116 (2012). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Simmons}, Lect. Notes Comput. Sci. 7386, 103--116 (2012; Zbl 1304.68141) Full Text: DOI
Blanchet-Sadri, Francine; Jiao, Yang; Machacek, John M. Squares in binary partial words. (English) Zbl 1370.68240 Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 404-415 (2012). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 7410, 404--415 (2012; Zbl 1370.68240) Full Text: DOI
Blanchet-Sadri, Francine; Simmons, Sean Abelian pattern avoidance in partial words. (English) Zbl 1365.68361 Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 210-221 (2012). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Simmons}, Lect. Notes Comput. Sci. 7464, 210--221 (2012; Zbl 1365.68361) Full Text: DOI Numdam
Blanchet-Sadri, F.; Ji, Steven; Reiland, Elizabeth Number of holes in unavoidable sets of partial words. II. (English) Zbl 1273.68288 J. Discrete Algorithms 14, 65-73 (2012). MSC: 68R15 68Q17 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 14, 65--73 (2012; Zbl 1273.68288) Full Text: DOI
Blanchet-Sadri, F.; Chen, Bob; Chakarov, Aleksandar Number of holes in unavoidable sets of partial words. I. (English) Zbl 1273.68287 J. Discrete Algorithms 14, 55-64 (2012). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 14, 55--64 (2012; Zbl 1273.68287) Full Text: DOI
Blanchet-Sadri, F.; Mercaş, Robert; Rashin, Abraham; Willett, Elara Periodicity algorithms and a conjecture on overlaps in partial words. (English) Zbl 1250.68216 Theor. Comput. Sci. 443, 35-45 (2012). Reviewer: Turek Ondřej (Kochi) MSC: 68R15 68W05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 443, 35--45 (2012; Zbl 1250.68216) Full Text: DOI
Blanchet-Sadri, F.; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater Constructing partial words with subword complexities not achievable by full words. (English) Zbl 1244.68063 Theor. Comput. Sci. 432, 21-27 (2012). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 432, 21--27 (2012; Zbl 1244.68063) Full Text: DOI
Blanchet-Sadri, F.; Mercaş, Robert The three-squares lemma for partial words with one hole. (English) Zbl 1250.68215 Theor. Comput. Sci. 428, 1-9 (2012). Reviewer: Anton Cerny (Safat) MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{R. Mercaş}, Theor. Comput. Sci. 428, 1--9 (2012; Zbl 1250.68215) Full Text: DOI
Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric Erratum to: “Avoidable binary patterns in partial words”. (English) Zbl 1234.68196 Acta Inf. 49, No. 1, 53-54 (2012). MSC: 68Q45 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Acta Inf. 49, No. 1, 53--54 (2012; Zbl 1234.68196) Full Text: DOI
Blanchet-Sadri, F.; Simmons, Sean; Xu, Dimin Abelian repetitions in partial words. (English) Zbl 1231.68187 Adv. Appl. Math. 48, No. 1, 194-214 (2012). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Adv. Appl. Math. 48, No. 1, 194--214 (2012; Zbl 1231.68187) Full Text: DOI
Blanchet-Sadri, F.; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean; Xu, Dimin Avoiding Abelian squares in partial words. (English) Zbl 1233.68183 J. Comb. Theory, Ser. A 119, No. 1, 257-270 (2012). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., J. Comb. Theory, Ser. A 119, No. 1, 257--270 (2012; Zbl 1233.68183) Full Text: DOI
Blanchet-Sadri, Francine; Nelson, Sarah; Tebbe, Amelia On operations preserving primitivity of partial words with one hole. (English) Zbl 1341.68141 Dömösi, Pál (ed.) et al., Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17–22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics (ISBN 978-615-5097-19-5/pbk). 93-107 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., in: Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17--22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics. 93--107 (2011; Zbl 1341.68141)
Blanchet-Sadri, Francine Open problems on avoidable patterns in partial words. (English) Zbl 1341.68140 Dömösi, Pál (ed.) et al., Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17–22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics (ISBN 978-615-5097-19-5/pbk). 12-24 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, in: Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17--22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics. 12--24 (2011; Zbl 1341.68140)
Blanchet-Sadri, Francine; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater Recurrent partial words. (English) Zbl 1331.68164 Ambrož, Petr (ed.) et al., Proceedings of the 8th international conference, Words 2011, Prague, Czech Republic, September, 12–16, 2011. Sydney: NICTA. Electronic Proceedings in Theoretical Computer Science 63, 71-82 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., in: Proceedings of the 8th international conference, Words 2011, Prague, Czech Republic, September, 12--16, 2011. Sydney: NICTA. 71--82 (2011; Zbl 1331.68164) Full Text: DOI arXiv EMIS
Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric Avoidable binary patterns in partial words. (English) Zbl 1243.68230 Acta Inf. 48, No. 1, 25-41 (2011). Reviewer: Panayiotis Vlamos (Athens) MSC: 68R15 11B85 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Acta Inf. 48, No. 1, 25--41 (2011; Zbl 1243.68230) Full Text: DOI
Blanchet-Sadri, Francine; Lensmire, John On minimal Sturmian partial words. (English) Zbl 1230.68123 Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 225-236, electronic only (2011). MSC: 68Q45 68R15 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{J. Lensmire}, LIPIcs -- Leibniz Int. Proc. Inform. 9, 225--236 (2011; Zbl 1230.68123) Full Text: DOI Link
Blanchet-Sadri, Francine; Mandel, Travis; Sisodia, Gautam Periods in partial words: an algorithm. (English) Zbl 1314.68247 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 57-70 (2011). MSC: 68R15 68Q45 68R10 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 7056, 57--70 (2011; Zbl 1314.68247) Full Text: DOI Link
Blanchet-Sadri, Francine; Simmons, Sean Avoiding abelian powers in partial words. (English) Zbl 1221.68177 Mauri, Giancarlo (ed.) et al., Developments in language theory. 15th international conference, DLT 2011, Milan, Italy, July 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22320-4/pbk). Lecture Notes in Computer Science 6795, 70-81 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Simmons}, Lect. Notes Comput. Sci. 6795, 70--81 (2011; Zbl 1221.68177) Full Text: DOI
Blanchet-Sadri, Francine; Blakeley, Brandon; Gunter, Josh; Simmons, Sean; Weissenstein, Eric Classifying all avoidable sets of partial words of size two. (English) Zbl 1228.68041 Martín-Vide, Carlos (ed.), Scientific applications of language methods. London: Imperial College Press (ISBN 978-1-84816-544-1/hbk; 978-1-84816-545-8/ebook). Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory 2, 59-101 (2011). MSC: 68R15 05C25 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Math. Comput. Lang. Life: Front. Math. Linguist. Lang. Theor. 2, 59--101 (2011; Zbl 1228.68041)
Allen, Emily; Blanchet-Sadri, F.; Byrum, Cameron; Cucuringu, Mihai; Mercaş, Robert Counting bordered partial words by critical positions. (English) Zbl 1221.68174 Electron. J. Comb. 18, No. 1, Research Paper P138, 26 p. (2011). MSC: 68R15 68Q45 05A05 PDFBibTeX XMLCite \textit{E. Allen} et al., Electron. J. Comb. 18, No. 1, Research Paper P138, 26 p. (2011; Zbl 1221.68174) Full Text: EuDML EMIS
Blanchet-Sadri, F.; Choi, Ilkyoo; Mercaş, Robert Avoiding large squares in partial words. (English) Zbl 1221.68176 Theor. Comput. Sci. 412, No. 29, 3752-3758 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 412, No. 29, 3752--3758 (2011; Zbl 1221.68176) Full Text: DOI
Blanchet-Sadri, Francine; Black, Kevin; Zemke, Andrew Unary pattern avoidance in partial words dense with holes. (English) Zbl 1330.68232 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 155-166 (2011). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 6638, 155--166 (2011; Zbl 1330.68232) Full Text: DOI
Blanchet-Sadri, Francine; Chen, Bob; Chakarov, Aleksandar Minimum number of holes in unavoidable sets of partial words of size three. (English) Zbl 1232.68096 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 43-55 (2011). Reviewer: Christopher Saker (Colchester) MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 6460, 43--55 (2011; Zbl 1232.68096) Full Text: DOI
Blanchet-Sadri, F.; Lensmire, John On minimal Sturmian partial words. (English) Zbl 1217.68165 Discrete Appl. Math. 159, No. 8, 733-745 (2011). Reviewer: Jeffrey Shallit (Waterloo) MSC: 68R15 68Q45 11Y16 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{J. Lensmire}, Discrete Appl. Math. 159, No. 8, 733--745 (2011; Zbl 1217.68165) Full Text: DOI Link
Blanchet-Sadri, Francine; Cucuringu, Mihai Counting primitive partial words. (English) Zbl 1345.68245 J. Autom. Lang. Comb. 15, No. 3/4, 199-227 (2010). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{M. Cucuringu}, J. Autom. Lang. Comb. 15, No. 3/4, 199--227 (2010; Zbl 1345.68245) Full Text: DOI
Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad On the complexity of deciding avoidability of sets of partial words. (English) Zbl 1208.68164 Theor. Comput. Sci. 411, No. 49, 4263-4271 (2010). MSC: 68R15 68Q25 PDFBibTeX XMLCite \textit{B. Blakeley} et al., Theor. Comput. Sci. 411, No. 49, 4263--4271 (2010; Zbl 1208.68164) Full Text: DOI
Blanchet-Sadri, F.; Clader, E.; Simpson, O. Border correlations of partial words. (English) Zbl 1205.68273 Theory Comput. Syst. 47, No. 1, 179-195 (2010). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theory Comput. Syst. 47, No. 1, 179--195 (2010; Zbl 1205.68273) Full Text: DOI Link
Blanchet-Sadri, Francine; Schwartz, Jarett; Stich, Slater; Wyatt, Benjamin J. Binary de Bruijn partial words with one hole. (English) Zbl 1284.68482 Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 128-138 (2010). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 6108, 128--138 (2010; Zbl 1284.68482) Full Text: DOI
Blanchet-Sadri, Francine; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric Avoidable binary patterns in partial words. (English) Zbl 1284.68481 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 106-117 (2010). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 6031, 106--117 (2010; Zbl 1284.68481) Full Text: DOI
Blanchet-Sadri, Francine; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean Abelian square-free partial words. (English) Zbl 1284.68480 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 94-105 (2010). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 6031, 94--105 (2010; Zbl 1284.68480) Full Text: DOI
Blanchet-Sadri, F.; Mercas, Robert; Scott, Geoffrey Counting distinct squares in partial words. (English) Zbl 1199.68199 Acta Cybern. 19, No. 2, 465-477 (2009). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Acta Cybern. 19, No. 2, 465--477 (2009; Zbl 1199.68199)
Blanchet-Sadri, Francine; Mercaş, Robert A note on the number of squares in a partial word with one hole. (English) Zbl 1192.68496 Theor. Inform. Appl. 43, No. 4, 767-774 (2009). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{R. Mercaş}, Theor. Inform. Appl. 43, No. 4, 767--774 (2009; Zbl 1192.68496) Full Text: DOI EuDML Link
Blanchet-Sadri, F.; Brownstein, N. C.; Kalcic, Andy; Palumbo, Justin; Weyand, T. Unavoidable sets of partial words. (English) Zbl 1187.68358 Theory Comput. Syst. 45, No. 2, 381-406 (2009). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theory Comput. Syst. 45, No. 2, 381--406 (2009; Zbl 1187.68358) Full Text: DOI Link
Blanchet-Sadri, Francine; Allen, Emily; Byrum, Cameron; Mercaş, Robert How many holes can an unbordered partial word contain? (English) Zbl 1234.68327 Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 176-187 (2009). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 5457, 176--187 (2009; Zbl 1234.68327) Full Text: DOI
Blanchet-Sadri, F.; Jungers, Raphaël M.; Palumbo, Justin Testing avoidability on sets of partial words is hard. (English) Zbl 1162.68028 Theor. Comput. Sci. 410, No. 8-10, 968-972 (2009). MSC: 68R15 68Q17 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 410, No. 8--10, 968--972 (2009; Zbl 1162.68028) Full Text: DOI
Blanchet-Sadri, F.; Mercaş, Robert; Scott, Geoffrey A generalization of Thue freeness for partial words. (English) Zbl 1162.68029 Theor. Comput. Sci. 410, No. 8-10, 793-800 (2009). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 410, No. 8--10, 793--800 (2009; Zbl 1162.68029) Full Text: DOI Link
Blanchet-Sadri, Francine; Blair, D. Dakota; Lewis, Rebeca V. Equations on partial words. (English) Zbl 1170.68032 Theor. Inform. Appl. 43, No. 1, 23-39 (2009). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Theor. Inform. Appl. 43, No. 1, 23--39 (2009; Zbl 1170.68032) Full Text: DOI EuDML Link
Blanchet-Sadri, F.; Bromberg, L.; Zipple, K. Remarks on two nonstandard versions of periodicity in words. (English) Zbl 1173.68617 Int. J. Found. Comput. Sci. 19, No. 6, 1439-1448 (2008). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Int. J. Found. Comput. Sci. 19, No. 6, 1439--1448 (2008; Zbl 1173.68617) Full Text: DOI
Blanchet-Sadri, F.; Corcoran, Kevin; Nyberg, Jenell Periodicity properties on partial words. (English) Zbl 1160.68026 Inf. Comput. 206, No. 9-10, 1057-1064 (2008). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Inf. Comput. 206, No. 9--10, 1057--1064 (2008; Zbl 1160.68026) Full Text: DOI Link
Blanchet-Sadri, Francine Open problems on partial words. (English) Zbl 1156.68510 Bel-Enguix, Gemma (ed.) et al., New developments in formal languages and applications. Berlin: Springer (ISBN 978-3-540-78290-2/hbk). Studies in Computational Intelligence 113, 11-58 (2008). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Stud. Comput. Intell. 113, 11--58 (2008; Zbl 1156.68510)
Blanchet-Sadri, F.; Bal, Deepak; Sisodia, Gautam Graph connectivity, partial words, and a theorem of Fine and Wilf. (English) Zbl 1146.68408 Inf. Comput. 206, No. 5, 676-693 (2008). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Inf. Comput. 206, No. 5, 676--693 (2008; Zbl 1146.68408) Full Text: DOI
Blanchet-Sadri, Francine Algorithmic combinatorics on partial words. (English) Zbl 1180.68205 Discrete Mathematics and Its Applications. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-4200-6092-8/hbk; 978-1-4200-6093-5/ebook). 385 p. (2008). MSC: 68R15 68-01 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Algorithmic combinatorics on partial words. Boca Raton, FL: Chapman \& Hall/CRC (2008; Zbl 1180.68205) Full Text: DOI
Blanchet-Sadri, F.; Brownstein, N. C.; Palumbo, Justin Two element unavoidable sets of partial words. (English) Zbl 1202.68294 Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3–6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 96-107 (2007). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 4588, 96--107 (2007; Zbl 1202.68294) Full Text: DOI
Blanchet-Sadri, F.; Wetzler, Nathan D. Partial words and the critical factorization theorem revisited. (English) Zbl 1124.68086 Theor. Comput. Sci. 385, No. 1-3, 179-192 (2007). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{N. D. Wetzler}, Theor. Comput. Sci. 385, No. 1--3, 179--192 (2007; Zbl 1124.68086) Full Text: DOI Link
Blanchet-Sadri, Francine; Gafni, Joshua D.; Wilson, Kevin H. Correlations of partial words. (English) Zbl 1186.68344 Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 97-108 (2007). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 4393, 97--108 (2007; Zbl 1186.68344) Full Text: DOI
Blanchet-Sadri, F.; Anavekar, Arundhati R. Testing primitivity on partial words. (English) Zbl 1108.68093 Discrete Appl. Math. 155, No. 3, 279-287 (2007). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. R. Anavekar}, Discrete Appl. Math. 155, No. 3, 279--287 (2007; Zbl 1108.68093) Full Text: DOI Link
Blanchet-Sadri, F.; Blair, D. Dakota; Lewis, Rebeca V. Equations on partial words. (English) Zbl 1132.68513 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28–September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 167-178 (2006). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} et al., Lect. Notes Comput. Sci. 4162, 167--178 (2006; Zbl 1132.68513) Full Text: DOI
Blanchet-Sadri, F.; Duncan, S. Partial words and the critical factorization theorem. (English) Zbl 1073.68067 J. Comb. Theory, Ser. A 109, No. 2, 221-245 (2005). MSC: 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{S. Duncan}, J. Comb. Theory, Ser. A 109, No. 2, 221--245 (2005; Zbl 1073.68067) Full Text: DOI
Blanchet-Sadri, F. Codes, orderings, and partial words. (English) Zbl 1086.68108 Theor. Comput. Sci. 329, No. 1-3, 177-202 (2004). MSC: 68R15 05A05 68Q45 94A45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Theor. Comput. Sci. 329, No. 1--3, 177--202 (2004; Zbl 1086.68108) Full Text: DOI
Blanchet-Sadri, F.; Chriscoe, Ajay Local periods and binary partial words: an algorithm. (English) Zbl 1070.68061 Theor. Comput. Sci. 314, No. 1-2, 189-216 (2004). MSC: 68Q45 68R15 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{A. Chriscoe}, Theor. Comput. Sci. 314, No. 1--2, 189--216 (2004; Zbl 1070.68061) Full Text: DOI
Blanchet-Sadri, F. Periodicity on partial words. (English) Zbl 1068.68110 Comput. Math. Appl. 47, No. 1, 71-82 (2004). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Comput. Math. Appl. 47, No. 1, 71--82 (2004; Zbl 1068.68110) Full Text: DOI
Blanchet-Sadri, F. A periodicity result of partial words with one hole. (English) Zbl 1074.68046 Comput. Math. Appl. 46, No. 5-6, 813-820 (2003). MSC: 68R15 05A05 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri}, Comput. Math. Appl. 46, No. 5--6, 813--820 (2003; Zbl 1074.68046) Full Text: DOI
Blanchet-Sadri, F.; Luhmann, D. K. Conjugacy on partial words. (English) Zbl 1061.68123 Theor. Comput. Sci. 289, No. 1, 297-312 (2002). MSC: 68R15 92D20 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{D. K. Luhmann}, Theor. Comput. Sci. 289, No. 1, 297--312 (2002; Zbl 1061.68123) Full Text: DOI
Blanchet-Sadri, F.; Howell, T. Note on decipherability of three-word codes. (English) Zbl 1004.94014 Int. J. Math. Math. Sci. 30, No. 8, 491-504 (2002). MSC: 94A45 68R15 94B35 05A99 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{T. Howell}, Int. J. Math. Math. Sci. 30, No. 8, 491--504 (2002; Zbl 1004.94014) Full Text: DOI EuDML Link
Blanchet-Sadri, F.; Hegstrom, Robert A. Partial words and a theorem of Fine and Wilf revisited. (English) Zbl 0988.68142 Theor. Comput. Sci. 270, No. 1-2, 401-419 (2002). MSC: 68R15 68Q45 PDFBibTeX XMLCite \textit{F. Blanchet-Sadri} and \textit{R. A. Hegstrom}, Theor. Comput. Sci. 270, No. 1--2, 401--419 (2002; Zbl 0988.68142) Full Text: DOI