On binary trees and Dyck pathsPANAYOTOPOULOS, A; SAPOUNAKIS, A.Mathématiques, informatique et sciences humaines. 1995, Num 131, pp 39-51, issn 0995-2314Article

Palindromes in sturmian wordsDE LUCA, Aldo; DE LUCA, Alessandro.Lecture notes in computer science. 2005, pp 199-208, issn 0302-9743, isbn 3-540-26546-5, 10 p.Conference Paper

Avoidable sets and well quasi-ordersD'ALESSANDRO, Flavio; VARRICCHIO, Stefano.Lecture notes in computer science. 2004, pp 139-150, issn 0302-9743, isbn 3-540-24014-4, 12 p.Conference Paper

On codes, ω-codes and ω-generatorsJULIA, S; LITOVSKY, I; PATROU, B et al.Information processing letters. 1996, Vol 60, Num 1, pp 1-5, issn 0020-0190Article

Codes and maximal monoidsSHIN, Sujin.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1809-1817, issn 0304-3975, 9 p.Article

Algebraic recognizability of languagesWEIL, Pascal.Lecture notes in computer science. 2004, pp 149-175, issn 0302-9743, isbn 3-540-22823-3, 27 p.Conference Paper

A hierarchy of cyclic languagesCARTON, O.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 4, pp 355-369, issn 0988-3754Article

Codage des polyominos convexes et équations pour l'énumération suivant l'aire = Coding of convex polyominoes and equations for area-based enumerationBOUSQUET-MELOU, M.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 21-43, issn 0166-218XArticle

The complexity of the word-problem for finite matrix ringsSZABO, Csaba; VERTESI, Vera.Proceedings of the American Mathematical Society. 2004, Vol 132, Num 12, pp 3689-3695, issn 0002-9939, 7 p.Article

Forbidden factors and fragment assemblyMIGNOSI, F; RESTIVO, A; SCIORTINO, M et al.Theoretical informatics and applications. 2001, Vol 35, Num 6, pp 565-577Article

Enumeration of bordered words; Enumération des mots à bords = Enumération des mots à bordsREGNIER, Mireille.Rapports de recherche - INRIA. 1988, Vol 956, issn 0249-6399, 12 p.Report

On the repetition threshold for large alphabetsCARPI, Arturo.Lecture notes in computer science. 2006, pp 226-237, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in generalOTTO, F.Information processing letters. 1995, Vol 53, Num 5, pp 237-242, issn 0020-0190Article

Synchronized rational relations of finite and infinite words = Relations rationnelles synchronisées des mots finis et infinisFROUGNY, C; SAKAROVITCH, J.Theoretical computer science. 1993, Vol 108, Num 1, pp 45-82, issn 0304-3975Conference Paper

On a generalization of Christoffel words: epichristoffel wordsPAQUIN, Geneviève.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3782-3791, issn 0304-3975, 10 p.Article

Ciliate bio-operations on finite string multisetsDASSOW, Jürgen; VASZIL, György.Lecture notes in computer science. 2006, pp 168-179, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

ON THE DOL REPETITION THRESHOLDGOLDSTEIN, Ilya.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 3, pp 281-292, issn 0988-3754, 12 p.Article

Some characterizations of finite Sturmian wordsDE LUCA, Aldo; DE LUCA, Alessandro.Theoretical computer science. 2006, Vol 356, Num 1-2, pp 118-125, issn 0304-3975, 8 p.Article

An algebraic generalization of ω-regular languagesESIK, Zoltan; KUICH, Werner.Lecture notes in computer science. 2004, pp 648-659, issn 0302-9743, isbn 3-540-22823-3, 12 p.Conference Paper

Well-quasi-orders and regular ω-languagesOGAWA, Mizuhito.Theoretical computer science. 2004, Vol 324, Num 1, pp 55-60, issn 0304-3975, 6 p.Conference Paper

On the distribution of characteristic parameters of wordsCARPI, Arturo; DE LUCA, Aldo.Theoretical informatics and applications. 2002, Vol 36, Num 1, pp 67-96Article

On the length of the homotopic Brownian word in the thrice punctured sphereGRUET, J.-C.Probability theory and related fields. 1998, Vol 111, Num 4, pp 489-516, issn 0178-8051Article

A fast average case algorithm for Lyndon decompositionILIOPOULOS, C. S; SMYTH, W. F.International journal of computer mathematics. 1995, Vol 57, Num 1-2, pp 15-31, issn 0020-7160Article

Symbolic representation of piecewise linear functions on the unit interval and application to discrepancyBOREL, J.-P.Theoretical computer science. 1994, Vol 123, Num 1, pp 61-87, issn 0304-3975Conference Paper

The distribution of subword counts is usually normalBENDER, E. A; KOCHMAN, F.European journal of combinatorics. 1993, Vol 14, Num 4, pp 265-275, issn 0195-6698Article