- Joost Engelfriet and Giora Slutzki. Bounded nesting in macro
grammars. Information and Control, 42(2):157-193,
August 1979.
- Joost Engelfriet and Grzegorz Rozenberg. Equality languages and fixed
point languages. Information and Control, 43(1):20-49,
October 1979.
Citations.
- Joost Engelfriet and Gilberto Filè Passes and paths of attributive
grammars. Information and Control, 49(2):125-169, May
1981.
Citations.
- Joost Engelfriet and Grzegorz Rozenberg. A tranlsational theorem for the
class of EOL languages. Information and Control,
50(2):175-183, August 1981.
- Joost Engelfriet and Heiko Vogler. Look-ahead on pushdowns.
Information and Computation, 73(3):245-279, June 1987.
Citations.
- Joost Engelfriet. The
power to two-way deterministic checking stack automata.
Information and Computation, 80(2):114-120, February 1989.
References.
- Joost Engelfriet and George Leih. Linear graph grammars: Power and
complexity. Information and Computation, 81(1):88-121,
April 1989.
References
and Citations.
- Joost Engelfriet and Grzegorz Rozenberg. A comparison of boundary graph
grammars and context-free hypergraph grammars. Information and
Computation, 84(2):163-206, February 1990.
References
and Citations.
- Joost Engelfriet. Iterated stack automata and
complexity classes. Information and Computation,
95(1):21-75, November 1991.
References
and Citations.
- Frank Drewes and Joost Engelfriet. Decidability of the finiteness of
ranges of tree transductions. Information and
Computation, 145(1):1-50, 25 August 1998.
Abstract
and References.
- Joost Engelfriet. Derivation
trees of ground term rewriting systems. Accepted for publication in
Information and Computation. Final manuscript received for
publication June 24, 1998.
References.
Shortcuts: