A note on a conjecture of duval and sturmian wordsMIGNOSI, Filippo; ZAMBONI, Luca Q.Theoretical informatics and applications. 2002, Vol 36, Num 1, pp 1-3Article

Inequalities characterizing standard Sturmian and episturmian wordsPIRILLO, Giuseppe.Theoretical computer science. 2005, Vol 341, Num 1-3, pp 276-292, issn 0304-3975, 17 p.Article

Growth of repetition-free words- : a reviewBERSTEL, Jean.Theoretical computer science. 2005, Vol 340, Num 2, pp 280-290, issn 0304-3975, 11 p.Article

Occurrences of palindromes in characteristic Sturmian wordsGLEN, Amy.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 31-46, issn 0304-3975, 16 p.Article

Smooth words over arbitrary alphabetsBERTHE, Valérie; BRLEK, Srecko; CHOQUETTE, Philippe et al.Theoretical computer science. 2005, Vol 341, Num 1-3, pp 293-310, issn 0304-3975, 18 p.Article

A Complementary Systems Account of Word Learning in L1 and L2LINDSAY, Shane; GASKELL, M. Gareth.Language learning. 2010, Vol 60, pp 45-63, issn 0023-8333, 19 p., SUP2Conference Paper

A proof of the extended Duval's conjectureHOLUB, Stepan.Theoretical computer science. 2005, Vol 339, Num 1, pp 61-67, issn 0304-3975, 7 p.Conference Paper

On the arithmetical complexity of Sturmian wordsCASSAIGNE, J; FRID, A. E.Theoretical computer science. 2007, Vol 380, Num 3, pp 304-316, issn 0304-3975, 13 p.Conference Paper

Lexical categories in PersianKARIMI-DOOSTAN, Gh.Lingua (Haarlem. Print). 2011, Vol 121, Num 2, pp 207-220, issn 0024-3841, 14 p.Article

STURMIAN JUNGLE (OR GARDEN?) ON MULTILITERAL ALPHABETSBALKOVA, L'ubomíra; PELANTOVA, Edita; STAROSTA, Stěpán et al.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 4, pp 443-470, issn 0988-3754, 28 p.Article

A multidimensional critical factorization theoremEPIFANIO, Chiara; MIGNOSI, Filippo.Theoretical computer science. 2005, Vol 346, Num 2-3, pp 265-280, issn 0304-3975, 16 p.Article

Lexicographically least words in the orbit closure of the Rudin―Shapiro wordCURRIE, James.Theoretical computer science. 2011, Vol 412, Num 35, pp 4742-4746, issn 0304-3975, 5 p.Article

A NOTE ON THE NUMBER OF SQUARES IN A PARTIAL WORD WITH ONE HOLEBLANCHET-SADRI, Francine; MERCAS, Robert.Informatique théorique et applications (Imprimé). 2009, Vol 43, Num 4, pp 767-774, issn 0988-3754, 8 p.Article

A little more about morphic stumian wordsFAGNOT, Isabelle.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 3, pp 511-518, issn 0988-3754, 8 p.Article

On possible growths of arithmetical complexityFRID, Anna E.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 3, pp 443-458, issn 0988-3754, 16 p.Conference Paper

Words containing a basis for the algebra of all matricesROSENTHAL, Daniel.Linear algebra and its applications. 2012, Vol 436, Num 7, pp 2615-2617, issn 0024-3795, 3 p.Article

On theta-palindromic richnessSTAROSTA, Stěpán.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1111-1121, issn 0304-3975, 11 p.Article

Sequences of low arithmetical complexityAVGUSTINOVICH, Sergey V; CASSAIGNE, Julien; FRID, Anna E et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 4, pp 569-582, issn 0988-3754, 14 p.Article

Sequences of linear arithmetical complexityFRID, A. E.Theoretical computer science. 2005, Vol 339, Num 1, pp 68-87, issn 0304-3975, 20 p.Conference Paper

Testing primitivity on partial wordsBLANCHET-SADRI, F; ANAVEKAR, Arundhati R.Discrete applied mathematics. 2007, Vol 155, Num 3, pp 279-287, issn 0166-218X, 9 p.Article

Zipf's Law and Avoidance of Excessive SynonymyMANIN, Dmitrii Y.Cognitive science. 2008, Vol 32, Num 7, pp 1075-1098, issn 0364-0213, 24 p.Article

Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary wordsBASIC, Bojan.Discrete applied mathematics. 2012, Vol 160, Num 1-2, pp 181-186, issn 0166-218X, 6 p.Article

A new characteristic property of rich wordsBUCCI, Michelangelo; DE LUCA, Alessandro; GLEN, Amy et al.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2860-2863, issn 0304-3975, 4 p.Article

Spelling-sound consistency effects in disyllabic word namingCHATEAU, Dan; JARED, Debra.Journal of memory and language (Print). 2003, Vol 48, Num 2, pp 255-280, issn 0749-596X, 26 p.Article

Unbordered partial wordsBLANCHET-SADRI, F; DAVIS, C. D; DODGE, Joel et al.Discrete applied mathematics. 2009, Vol 157, Num 5, pp 890-900, issn 0166-218X, 11 p.Article