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 binary trees and Dyck pathsPANAYOTOPOULOS, A; SAPOUNAKIS, A.Mathématiques, informatique et sciences humaines. 1995, Num 131, pp 39-51, issn 0995-2314Article

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

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

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

On the length of word chainsBERSTEL, J; BRLEK, S.Information processing letters. 1987, Vol 26, Num 1, pp 23-28, issn 0020-0190Article

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

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

COMPARISON OF OPTIMAL AND LOCAL SEARCH METHODS FOR DESIGNING FINITE WORDLENGTH FIR DIGITAL FILTERSKODEK D; STEIGLITZ K.1981; IEEE TRANS. CIRCUITS SYST.; ISSN 0098-4094; USA; DA. 1981; VOL. 28; NO 1; PP. 28-32; BIBL. 10 REF.Article

DESIGN OF TWO-DIMENSIONAL RECURSIVE DIGITAL FILTERS WITH COEFFICIENTS OF FINITE WORD LENGTHSICURANZA GL.1982; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS.; ISSN 0096-3518; USA; DA. 1982; VOL. 30; NO 1; PP. 109-112; BIBL. 3 REF.Article

On the simplification of infinite morphic wordsHONKALA, Juha.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 997-1000, issn 0304-3975, 4 p.Article

Exponential lower bounds for the number of words of uniform length avoiding a patternBELL, Jason P; TEOW LIM GOH.Information and computation (Print). 2007, Vol 205, Num 9, pp 1295-1306, issn 0890-5401, 12 p.Article

Periodicity and unbordered words : A proof of the extended duval conjectureHARJU, Tero; NOWOTKA, Dirk.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 4, issn 0004-5411, E1-E20Article

Infinite unfair shuffles and associativityTER BEEK, Maurice H; KLEIJN, Jetty.Theoretical computer science. 2007, Vol 380, Num 3, pp 401-410, issn 0304-3975, 10 p.Conference Paper

Finite monoids : From word to circuit evaluationBEAUDRY, M; MCKENZIE, P; PELADEAU, P et al.SIAM journal on computing (Print). 1997, Vol 26, Num 1, pp 138-152, issn 0097-5397Article

Which finite monoids are syntactic monoids of rational ω-languagesPHAN TRUNG HUY; LIVOTSKY, I; DO LONG VAN et al.Information processing letters. 1992, Vol 42, Num 3, pp 127-132, issn 0020-0190Article

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