ON THE DECIDABILITY OF SOME EQUIVALENCE PROBLEMS FOR DOL-SYSTEMS.NIELSEN M.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 166-193; BIBL. 8 REF.Article

Adherences of D0L languagesHEAD, T.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 139-149, issn 0304-3975Article

ON THE EMPTINESS OF THE INTERSECTION OF TWO DOS LANGUAGES PROBLEMEHRENFEUCHT A; ROZENBERG G.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 223-225; BIBL. 4 REF.Article

DIGRAPHS ASSOCIATED WITH DOL SYSTEMS.VITANYI PMB.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 40; PP. 1-12; BIBL. 17 REF.Article

THE DECIDABILITY OF THE DOL-DTOL EQUIVALENCE PROBLEMRUOHONEN K.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 42-52; BIBL. 18 REF.Article

THE W-SEQUENCE EQUIVALENCE PROBLEM FOR DOC SYSTEMS IS DECIDABLECULIK K II; HARJU T.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 1-6; BIBL. 15 REF.Conference Paper

EVERY TWO EQUIVALENT DOL SYSTEMS HAVE A REGULAR TRUE ENVELOPEEHRENFEUCHT A; ROZENBERG G.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 45-52; BIBL. 3 REF.Article

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

ON SUBWORD COMPLEXITIES OF HOMOMORPHIC IMAGES OF LANGUAGESEHRENFEUCHT A; ROZENBERG G.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 4; PP. 303-316; ABS. FRE; BIBL. 4 REF.Article

ON A BOUND FOR THE DOL SEQUENCE EQUIVALENCE PROBLEMEHRENFEUCHT A; ROZENBERG G.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 339-342; BIBL. 3 REF.Article

ON ETOL SYSTEMS WITH BANKEHRENFEUCHT A; ROZENBERG G; VERMEIR D et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 237-255; BIBL. 8 REF.Article

Easy cases of the DOL sequence equivalence problemHONKALA, Juha.Discrete applied mathematics. 2001, Vol 113, Num 2-3, pp 285-290, issn 0166-218XArticle

Code properties and homomorphisms of DOL systemsHEAD, T; WILKINSON, J.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 295-312, issn 0304-3975Article

On standard locally catenative L schemesSEKI, S; KOBUCHI, Y.Theoretical computer science. 1991, Vol 83, Num 2, pp 237-248, issn 0304-3975, 12 p.Article

No iterated morphism generates any Arshon sequence of odd orderCURRIE, James D.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 277-283, issn 0012-365X, 7 p.Article

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

REMARKS ON LOCALLY CATENATIVE DEVELOPMENTAL SEQUENCESRUOHONEN K.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 4; PP. 171-180; ABS. GER/RUS; BIBL. 8 REF.Article

A NOTE ON THE COMPLEXITY OF GENERAL DOL MEMBERSHIPJONES ND; SKYUM S.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 114-117; BIBL. 5 REF.Article

CHARACTERIZATION OF THE STRUCTURE-GENERATING FUNCTIONS OF REGULAR SETS AND THE DOL GROWTH FUNCTIONS.KATAYAMA T; OKAMOTO M; ENOMOTO H et al.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 1; PP. 85-101; BIBL. 7 REF.Article

NOTE ON DOL LENGTH SETS.EHRENFEUCHT A; KARHUMAKI J; ROZENBERG G et al.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 233-242; BIBL. 10 REF.Article

The language equivalence problem for HDOL systems having DOL growthsHONKALA, Juha.Theoretical computer science. 2005, Vol 330, Num 1, pp 123-133, issn 0304-3975, 11 p.Article

Simple reductions between D0L language and sequence equivalence problemsSALOMAA, A.Discrete applied mathematics. 1993, Vol 41, Num 3, pp 271-274, issn 0166-218XArticle

Periodicity and ultimate periodicity of D0L systemsLANDO, B.Theoretical computer science. 1991, Vol 82, Num 1, pp 19-33, issn 0304-3975Article

SUR L'AUTOMATICITÉ DES MOTS DE TOEPLITZ = ABOUT THE AUTOMATICITY OF TOEPLITZ WORDSSaliba Bercoff, Christiane; Séébold, Patrice.2000, 250 p.Thesis

On sequences defined by D0L power seriesHONKALA, J.Informatique théorique et applications (Imprimé). 1999, Vol 33, Num 2, pp 125-132, issn 0988-3754Article