THE MEMBERSHIP QUESTION FOR ETOL-LANGUAGES IS POLYNOMIALLY COMPLETE.VAN LEEUWEN J.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 5; PP. 138-143; BIBL. 15 REF.Article

Decidable properties of monadic recursive schemas with a depth parameterGONCZAROWSKI, J.Acta informatica. 1985, Vol 22, Num 3, pp 277-310, issn 0001-5903Article

SPEED-VARYING OL SYSTEMS.CULIK K II; WOOD D.1978; INFORM. SCI.; U.S.A.; DA. 1978; VOL. 14; NO 2; PP. 161-170; BIBL. 4 REF.Article

ON THE STRUCTURE OF DERIVATIONS IN DETERMINISTIC ETOL SYSTEMSEHRENFEUCHT A; ROZENBERG G.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 3; PP. 331-347; BIBL. 9 REF.Article

COPYING THEOREMS.ENGELFRIET J; SKYUM S.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 6; PP. 157-161; BIBL. 13 REF.Article

TOL SCHEMES AND CONTROL SETS.GINSBURG S; ROZENBERG G.1975; INFORM. CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 2; PP. 109-125; BIBL. 11 REF.Article

A PUMPING THEOREM FOR DETERMINISTIC ETOL LANGUAGES.EHRENFUCHT A; ROZENBERG G.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 2; PP. 13-23; ABS. FR.; BIBL. 10 REF.Article

ETOL-GRAMMARS AND N-GRAMMARS.PENTTONEN M.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 11-13; BIBL. 13 REF.Article

ITERATING ITERATED SUBSTITUTION.ENGELFRIET J.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977 PARU 1978; VOL. 5; NO 1; PP. 85-100; BIBL. 1 P. 1/2Article

A note on exponential density of etol languagesMEDUNA, A.Kybernetika. 1986, Vol 22, Num 6, pp 514-518, issn 0023-5954Article

ON SOME CONTEXT FREE LANGUAGES THAT ARE NOT DETERMINISTIC ETOL LANGUAGES.EHRENFEUCHT A; ROZENBERG G.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 4; PP. 273-291; BIBL. 14 REF.Article

EVOLUTION DES INDEX RATIONNELS DE QUELQUES FAMILLES DE LANGAGES.STEYAERT JM.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 261; PP. 1-41; ABS. ANGL.; BIBL. 1 P.Serial Issue

A RELATIONSHIP BETWEEN ETOL AND EDTOL LANGUAGES.EHRENFEUCHT A; ROZENBERG G; SKYUM S et al.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 4; PP. 325-330; BIBL. 19 REF.Article

CONTEXT-FREE GRAMMARS WITH SELECTIVE REWRITINGROZENBERG G; WOOD D.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 3; PP. 257-268; BIBL. 12 REF.Article

HOMOMORPHISM EQUIVALENCE ON ETOL LANGUAGESTCULIK K; RICHIER JL.1979; INTERNATION. J. COMPUTER MATH.; USA; DA. 1979; VOL. 7; NO 1; PP. 43-51; BIBL. 13 REF.Article

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 cooperating grammars with terminal productionsCSUHAJ-VARJU, E.Computers and artificial intelligence. 1993, Vol 12, Num 1, pp 99-104, issn 0232-0274Article

The generative capacity of block-synchronized context-free grammarsMCQUILLAN, I.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 119-133, issn 0304-3975, 15 p.Article