ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMSCULIK K II; SALOMAA A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 29-38; BIBL. 12 REF.Article

SUR LES ENSEMBLES DE MOTS INFINIS ENGENDRES PAR UNE GRAMMAIRE ALGEBRIQUENIVAT M.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 259-278; BIBL. 4 REF.Article

VARIETES DE SEMIGROUPES ET MOTS INFINISPERRIN D.1982; C.R. SEANCES ACAD. SCI., SER. 1, MATH.; ISSN 0249-6291; FRA; DA. 1982; VOL. 295; NO 10; PP. 595-598; ABS. ENG; BIBL. 7 REF.Article

THE MORSE SEQUENCE AND ITERATED MORPHISMSPANSIOT JJ.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 2; PP. 68-70; BIBL. 6 REF.Article

FRONTIERS OF INFINITE TREES.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 272; PP. 1-26; ABS. FR.; BIBL. 6 REF.Serial Issue

MOTS INFINIS ENGENDRES PAR UNE GRAMMAIRE ALGEBRIQUE.NIVAT M.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 4; PP. 311-327; BIBL. 6 REF.Article

CONTEXT-FREE LANGUAGES OF FINITE WORDS AS LEAST FIXPOINTSPOIGNE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 301-320; BIBL. 7 REF.Conference Paper

On ω-languages whose syntactic monoid is trivialJURGENSEN, H; THIERRIN, G.International journal of computer & information sciences. 1983, Vol 12, Num 5, pp 359-365, issn 0091-7036Article

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

On infinite words obtained by selective substitution grammarsRANI SIROMONEY; RAJKUMAR DARE, V.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 281-295, issn 0304-3975Article

Théorie des langages et complexité des algorithmes. Journées d'Avignon, octobre 1983 = Languages theorie and algorithms complexityROZOY, B.Publications du Département de mathématiques. B. 1984, Num 6, 120 p.Conference Proceedings

The monadic theory of morphic infinite words and generalizationsCARTON, O; THOMAS, W.Lecture notes in computer science. 2000, pp 275-284, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Propriétés d'invariance des mots sturmiens = Invariance properties of Sturmian wordsPARVAIX, B.Journal de théorie des nombres de Bordeaux. 1997, Vol 9, Num 2, pp 351-369, issn 1246-7405Article

Crochemore factorization of sturmian and other infinite wordsBERSTEL, Jean; SAVELLI, Alessandra.Lecture notes in computer science. 2006, pp 157-166, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 10 p.Conference Paper

The monadic theory of morphic infinite words and generalizationsCARTONS, Olivier; THOMAS, Wolfgang.Information and computation (Print). 2002, Vol 176, Num 1, pp 51-65, issn 0890-5401Article

Fixed-point characterization of context-free ∞-languagesNIWINSKI, D.Information and control. 1984, Vol 61, Num 3, pp 247-276, issn 0019-9958Article

How to decide continuity of rational functions on infinite wordsPRIEUR, Christophe.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 445-447, issn 0304-3975Article

On the computational complexity of infinite wordsDURIS, Pavol; MANUCH, Jan.Lecture notes in computer science. 2001, pp 328-337, issn 0302-9743, isbn 3-540-42496-2Conference Paper

An infinite word language which is not co-CFLGRAZON, A.Information processing letters. 1987, Vol 24, Num 2, pp 81-85, issn 0020-0190Article

The ω-sequence equivalence problem for DOL systems is decidableCULIK, K. II; HARJU, T.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 2, pp 282-298, issn 0004-5411Article

Hiérarchie et fermeture de certaines classes de tag-systèmes = Hierarchy and closing of Somes Tag-systems classesPANSIOT, J.-J.Acta informatica. 1983, Vol 20, Num 2, pp 179-196, issn 0001-5903Article

Transfinite rewriting semantics for term rewriting systemsLUCAS, Salvador.Lecture notes in computer science. 2001, pp 216-230, issn 0302-9743, isbn 3-540-42117-3Conference Paper

On the number of Abelian square-free words on four lettersCARPI, A.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 155-167, issn 0166-218XArticle

Viennot factorization of infinite wordsMELANCON, G.Information processing letters. 1996, Vol 60, Num 2, pp 53-57, issn 0020-0190Article

Repetitions in the Fibonacci infinite wordMIGNOSI, F; PIRILLO, G.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 3, pp 199-204, issn 0988-3754Article