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

TOP-DOWN TREE TRANSDUCERS WITH REGULAR LOOK-AHEAD.ENGELFRIET J.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 4; PP. 289-303; BIBL. 16 REF.Article

SURFACE TREE LANGUAGES AND PARALLEL DERIVATION TREES.ENGELFRIET J.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 1; PP. 9-27; BIBL. 15 REF.Article

SIMPLE PROGRAM SCHEMES AND FORMAL LANGUAGES.ENGELFRIET J.1974; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1974; VOL. 20; PP. (260P.); BIBL. 6 P. 1/2Article

A NOTE ON INFINITE TREESENGELFRIET J.1972; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1972; VOL. 1; NO 6; PP. 229-232; BIBL. 9 REF.Serial Issue

Branching processes of Petri netsENGELFRIET, J.Acta informatica. 1991, Vol 28, Num 6, pp 575-591, issn 0001-5903Article

Determinacy → (observation equivalence=trace equivalence)ENGELFRIET, J.Theoretical computer science. 1985, Vol 36, Num 1, pp 21-25, issn 0304-3975Article

PASSES, SWEEPS AND VISITSENGELFRIET J; FILE G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 193-207; BIBL. 2 P.Conference Paper

THE FORMAL POWER OF ONE-VISIT ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 275-302; BIBL. 27 REF.Article

FIXED POINT LANGUAGES, EQUALITY LANGUAGES, AND REPRESENTATION OF RECURSIVELY ENUMERABLE LANGUAGESENGELFRIET J; ROZENBERG G.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 499-518; BIBL. 34 REF.Article

PASSES AND PATHS OF ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 2; PP. 125-169; BIBL. 1 P.Article

BOUNDED NESTING IN MACRO GRAMMARSENGELFRIET J; SLUTZKI G.1979; INFIRM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 2; PP. 157-193; BIBL. 1 P.Article

A regular characterization of graph languages definable in monadic second-order logicENGELFRIET, J.Theoretical computer science. 1991, Vol 88, Num 1, pp 139-150, issn 0304-3975Article

Iterated stack automata and complexity classesENGELFRIET, J.Information and computation (Print). 1991, Vol 95, Num 1, pp 21-75, issn 0890-5401Article

The power of two-way deterministic checking stack automataENGELFRIET, J.Information and computation (Print). 1989, Vol 80, Num 2, pp 114-120, issn 0890-5401Article

A TRANSLATIONAL THEOREM FOR THE CLASS OF EOL LANGUAGESENGELFRIET J; ROZENBERG G.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 2; PP. 175-183; BIBL. 10 REF.Article

FORMAL PROPERTIES OF ONE-VISIT AND MULTI-PASS ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 182-194; BIBL. 13 REF.Conference Paper

IO AND OI. II.ENGELFRIET J; SCHMIDT EM.1978; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1978; VOL. 16; NO 1; PP. 67-99; BIBL. 2 P.Article

ITERATED DETERMINISTIC SUBSTITUTION.ASVELD PRJ; ENGELFRIET J.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 285-302Article

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

Derivation trees of ground term rewriting systemsENGELFRIET, J.Information and computation (Print). 1999, Vol 152, Num 1, pp 1-15, issn 0890-5401Article

An elementary proof of double Greibach normal form = Une démonstration élémentaire de la double forme normale de GreibachENGELFRIET, J.Information processing letters. 1992, Vol 44, Num 6, pp 291-293, issn 0020-0190Article

The complexity of languages generated by attribute grammarsENGELFRIET, J.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 70-86, issn 0097-5397Article

EQUALITY LANGUAGES AND FIXED POINT LANGUAGESENGELFRIET J; ROZENBERG G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 1; PP. 20-49; BIBL. 19 REF.Article

TREE TRANSDUCERS, L SYSTEMS, AND TWO-WAY MACHINESENGELFRIET J; ROZENBERG G; SLUTZKI G et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 2; PP. 150-202; BIBL. 66 REF.Conference Paper