A test-set for k-power-free binary morphismsWLAZINSKI, F.Theoretical informatics and applications. 2001, Vol 35, Num 5, pp 437-452Article

Finite test-sets for overlap-free morphisms: (Extended abstract)RICHOMME, Gwenael; WLAZINSKI, Francis.Lecture notes in computer science. 2002, pp 605-614, issn 0302-9743, isbn 3-540-44040-2, 10 p.Conference Paper

Algebraic approach to single-pushout graph transformationLÖWE, M.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 181-224, issn 0304-3975Conference Paper

Some algorithms to compute the conjugates of Episturmian morphismsRICHOMME, Gwenael.Informatique théorique et applications (Imprimé). 2003, Vol 37, Num 1, pp 85-104, issn 0988-3754, 20 p.Article

Distributivity of categories of coalgebrasGUMM, H. Peter; HUGHES, Jesse; SCHRÖDER, Tobias et al.Theoretical computer science. 2003, Vol 308, Num 1-3, pp 131-143, issn 0304-3975, 13 p.Article

There are k-uniform cubefree binary morphisms for all k ≥ 0CURRIE, James; RAMPERSAD, Narad.Discrete applied mathematics. 2009, Vol 157, Num 11, pp 2548-2551, issn 0166-218X, 4 p.Article

Effective computation of the integral closure of a morphismBRENNAN, J. P; VASCONCELOS, W. V.Journal of pure and applied algebra. 1993, Vol 86, Num 2, pp 125-134, issn 0022-4049Article

Presentations for abstract context institutionsPAWLOWSKI, Wieslaw.Lecture notes in computer science. 2002, pp 256-279, issn 0302-9743, isbn 3-540-43159-4Conference Paper

Morphismes sturmiens et règlens de Rauzy = Sturmian morphisms and Rauzy rulesMIGNOSI, F; SEEBOLD, P.Journal de théorie des nombres de Bordeaux. 1993, Vol 5, Num 2, pp 221-233, issn 1246-7405Article

Les jeux de paume: systèmes des scores, morphismes et paradoxes = Palm games: score systems, morphisms and paradoxesPARLEBAS, P.Mathématiques et sciences humaines. 1985, Vol 23, Num 92, pp 41-68, issn 0025-5815Article

Episturmian morphisms and A Galois theorem on continued fractionsJUSTIN, Jacques.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 207-215, issn 0988-3754, 9 p.Article

Inverse morphic equivalence on languagesKARHUMAKI, J; WOOD, D.Information processing letters. 1984, Vol 19, Num 5, pp 213-218, issn 0020-0190Article

On Abelian 2-avoidable binary patternsCURRIE, James D; VISENTIN, Terry I.Acta informatica. 2007, Vol 43, Num 8, pp 521-533, issn 0001-5903, 13 p.Article

Harmonic morphisms with one-dimensional fibres on Einstein manifoldsPANTILIE, Radu; WOOD, John C.Transactions of the American Mathematical Society. 2002, Vol 354, Num 10, pp 4229-4243, issn 0002-9947Article

Grand crochet, crochets de Schouten et cohomologies d'algébres de Lie = The big bracket, Schouten brackets and Lie algebra cohomologiesKOSMANN-SCHWARZBACH, Y.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1991, Vol 312, Num 1, pp 123-126, issn 0764-4442, 4 p.Article

Parikh mapping and iterationDASSOW, Jürgen.Multiset processing (mathematical, computer science, and molecular computing points of view). Lecture notes in computer science. 2001, pp 85-101, issn 0302-9743, isbn 3-540-43063-6Book Chapter

Sur le lieu polaire de morphismes analytiques complexes = On the polar locus of complex analytic morphismsTaher, Sinane; El Zein, F.1996, 92 p.Thesis

Morphismes de Sturm = Sturm's morphismsBERSTEL, J; SEEBOLD, P.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 2, pp 175-189, issn 1370-1444Conference Paper

A natural notion of morphism for linear programming problemsCHAVEZ, J. D.Journal of combinatorial theory. Series A. 1989, Vol 52, Num 2, pp 206-227, issn 0097-3165, 22 p.Article

Un facteur direct canonique de la K-théorie d'anneaux d'entiers algébriques non exceptionnels = A canonical direct summand of the K-theory of non-exceptional rings of algebraic integersHAMRAOUI, Hinda.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 2001, Vol 332, Num 11, pp 957-962, issn 0764-4442Article

Restricted ambiguity of erasing morphismsREIDENBACH, Daniel; SCHNEIDER, Johannes C.Theoretical computer science. 2011, Vol 412, Num 29, pp 3510-3523, issn 0304-3975, 14 p.Article

STANDARD FACTORS OF STURMIAN WORDSRICHOMME, GwénaËl; SAARI, Kalle; ZAMBONI, Luca Q et al.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 1, pp 159-174, issn 0988-3754, 16 p.Conference Paper

Parties reconnaissables et morphismes sur les monoïdes trace = Recognizable sets and morphisms on trace monoidsGuaiana, Giovanna; Weil, P.1994, 118 p.Thesis

Pattern avoidance by palindromesMIKHAILOVA, I. A; VOLKOV, M. V.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2992-2998, issn 0304-3975, 7 p.Article

Avoiding Three Consecutive Blocks of the Same Size and Same SumCASSAIGNE, Julien; CURRIE, James D; SCHAEFFER, Luke et al.Journal of the Association for Computing Machinery. 2014, Vol 61, Num 2, issn 0004-5411, 10.1-10.17Article