Joost Engelfriet

167 papers A* 12A 2B 8C 4Journal 118Unranked 18

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Computability by monadic second-order logic. Inf. Process. Lett. Joost Engelfriet
2021	J	`jnl`	Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
2021	J	`jnl`	XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Theor. Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2020	J	`jnl`	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Discret. Math. Theor. Comput. Sci. Joost Engelfriet, Heiko Vogler
2020	J	`jnl`	Computability by Monadic Second-Order Logic. CoRR Joost Engelfriet
2019	J	`jnl`	A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. CoRR Joost Engelfriet, Heiko Vogler
2019	J	`jnl`	Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]. Inf. Comput. Joost Engelfriet
2019	J	`jnl`	Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. CoRR Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
2018	J	`jnl`	Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2018	J	`jnl`	XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. CoRR Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2017	J	`jnl`	Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
2017	J	`jnl`	Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. Michael Benedikt, Joost Engelfriet, Sebastian Maneth
2017	B	`conf`	Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT Joost Engelfriet, Andreas Maletti
2017	J	`jnl`	Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2017	J	`jnl`	The Trees of Hanoi. CoRR Joost Engelfriet
2016	—	`ch.`	Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet
2016	J	`jnl`	Erratum to: "Top-down Tree Transducers with Regular Look-ahead". Theory Comput. Syst. Joost Engelfriet
2016	J	`jnl`	Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2015	J	`jnl`	Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. Frank Drewes, Joost Engelfriet
2015	J	`jnl`	The generative power of delegation networks. Inf. Comput. Frank Drewes, Joost Engelfriet
2015	J	`jnl`	Tree Automata and Tree Grammars. CoRR Joost Engelfriet
2015	J	`jnl`	Two-way pebble transducers for partial functions and their composition. Acta Informatica Joost Engelfriet
2014	J	`jnl`	Context-Free Grammars with Storage. CoRR Joost Engelfriet
2014	C	`conf`	How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2013	B	`conf`	Determinacy and Rewriting of Top-Down and MSO Tree Transformations. MFCS Michael Benedikt, Joost Engelfriet, Sebastian Maneth
2013	J	`jnl`	Look-Ahead Removal for Top-Down Tree Transducers. CoRR Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2012	J	`jnl`	Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Bull. EATCS Bruno Courcelle, Joost Engelfriet
2012	—	`book`	Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Bruno Courcelle, Joost Engelfriet
2012	—	`conf`	Strong Lexicalization of Tree Adjoining Grammars. ACL (1) Andreas Maletti, Joost Engelfriet
2009	J	`jnl`	Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2009	J	`jnl`	Extended multi bottom-up tree transducers. Acta Informatica Joost Engelfriet, Eric Lilin, Andreas Maletti
2009	J	`jnl`	The time complexity of typechecking tree-walking tree transducers. Acta Informatica Joost Engelfriet
2008	C	`conf`	Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory Joost Engelfriet, Eric Lilin, Andreas Maletti
2007	J	`jnl`	A Kleene characterization of computability. Inf. Process. Lett. Joost Engelfriet
2007	J	`jnl`	An exercise in structural congruence. Inf. Process. Lett. Joost Engelfriet, Tjalling Gelsema
2007	J	`jnl`	Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure CoRR Joost Engelfriet, Hendrik Jan Hoogeboom
2007	J	`jnl`	Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Log. Methods Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom
2007	J	`jnl`	Finitary Compositions of Two-way Finite-State Transductions. Fundam. Informaticae Joost Engelfriet, Hendrik Jan Hoogeboom
2007	A*	`conf`	XML transformation by tree-walking transducers with invisible pebbles. PODS Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2006	J	`jnl`	Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2006	A	`conf`	Nested Pebbles and Transitive Closure. STACS Joost Engelfriet, Hendrik Jan Hoogeboom
2006	J	`jnl`	The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. Joost Engelfriet, Sebastian Maneth
2005	B	`conf`	Clique-Width for Four-Vertex Forbidden Subgraphs. FCT Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2005	—	`conf`	The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS Joost Engelfriet, Sebastian Maneth
2005	J	`jnl`	The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable CoRR Joost Engelfriet, Sebastian Maneth
2004	J	`jnl`	A new natural structural congruence in the pi-calculus with replication. Acta Informatica Joost Engelfriet, Tjalling Gelsema
2004	J	`jnl`	Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. Frank Drewes, Joost Engelfriet
2003	J	`jnl`	A comparison of pebble tree transducers with macro tree transducers. Acta Informatica Joost Engelfriet, Sebastian Maneth
2003	C	`conf`	Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory Frank Drewes, Joost Engelfriet
2003	J	`jnl`	Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. Joost Engelfriet, Sebastian Maneth
2002	J	`jnl`	Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. Joost Engelfriet, Zoltán Fülöp, Heiko Vogler
2002	J	`jnl`	Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. Joost Engelfriet, Sebastian Maneth
2002	—	`conf`	The Delta Operation: From Strings to Trees to Strings. Formal and Natural Computing Joost Engelfriet
2002	B	`conf`	Two-Way Finite State Transducers with Nested Pebbles. MFCS Joost Engelfriet, Sebastian Maneth
2001	C	`conf`	Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory Joost Engelfriet, Sebastian Maneth
2001	J	`jnl`	MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. Joost Engelfriet, Hendrik Jan Hoogeboom
2001	J	`jnl`	Structural inclusion in the pi-calculus with replication. Theor. Comput. Sci. Joost Engelfriet, Tjalling Gelsema
2000	J	`jnl`	A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars. J. Comput. Syst. Sci. Roderick Bloem, Joost Engelfriet
2000	A	`conf`	Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS Joost Engelfriet, Sebastian Maneth
1999	J	`jnl`	Derivation Trees of Ground Term Rewriting Systems. Inf. Comput. Joost Engelfriet
1999	J	`jnl`	MSO definable string transductions and two-way finite state transducers CoRR Joost Engelfriet, Hendrik Jan Hoogeboom
1999	J	`jnl`	Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. Joost Engelfriet, Sebastian Maneth
1999	J	`jnl`	Multisets and Structural Congruence of the pi-Calculus with Replication. Theor. Comput. Sci. Joost Engelfriet, Tjalling Gelsema
1999	—	`conf`	Tree-Walking Pebble Automata. Jewels are Forever Joost Engelfriet, Hendrik Jan Hoogeboom
1999	J	`jnl`	Trips on Trees. Acta Cybern. Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal van Best
1999	A*	`conf`	Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP Joost Engelfriet, Hendrik Jan Hoogeboom
1998	J	`jnl`	Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. Acta Informatica Joost Engelfriet, Tjalling Gelsema
1998	J	`jnl`	Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. Frank Drewes, Joost Engelfriet
1998	J	`jnl`	The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. Joost Engelfriet, Heiko Vogler
1998	—	`conf`	Tree Languages Generated be Context-Free Graph Grammars. TAGT Joost Engelfriet, Sebastian Maneth
1997	J	`jnl`	Context-Free Graph Grammars and Concatenation of Graphs. Acta Informatica Joost Engelfriet, Jan Joris Vereijken
1997	—	`ch.`	Context-Free Graph Grammars. Handbook of Formal Languages (3) Joost Engelfriet
1997	J	`jnl`	Domino Treewidth. J. Algorithms Hans L. Bodlaender, Joost Engelfriet
1997	J	`jnl`	Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. Joost Engelfriet, Vincent van Oostrom
1997	—	`conf`	Monadic Second Order Logic and Node Relations on Graphs and Trees. Structures in Logic and Computer Science Roderick Bloem, Joost Engelfriet
1997	—	`ch.`	Node Replacement Graph Grammars. Handbook of Graph Grammars Joost Engelfriet, Grzegorz Rozenberg
1996	J	`jnl`	A Multiset Semantics for the pi-Calculus with Replication. Theor. Comput. Sci. Joost Engelfriet
1996	J	`jnl`	Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg
1996	B	`conf`	Elementary Net Systems. Petri Nets Grzegorz Rozenberg, Joost Engelfriet
1996	J	`jnl`	Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
1996	J	`jnl`	Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. Joost Engelfriet, Vincent van Oostrom
1996	J	`jnl`	Reverse Twin Shuffles. Bull. EATCS Joost Engelfriet
1995	J	`jnl`	A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory Bruno Courcelle, Joost Engelfriet
1995	J	`jnl`	Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Informaticae Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg
1994	—	`conf`	Concatenation of Graphs. TAGT Joost Engelfriet, Jan Joris Vereijken
1994	J	`jnl`	Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. Acta Informatica Joost Engelfriet, Linda Heyker, George Leih
1994	—	`conf`	Deciding the NTS Property of Context-Free Grammars. Results and Trends in Theoretical Computer Science Joost Engelfriet
1994	B	`conf`	Domino Treewith (Extended Abstract). WG Hans L. Bodlaender, Joost Engelfriet
1994	—	`conf`	Graph Grammars and Tree Transducers. CAAP Joost Engelfriet
1994	J	`jnl`	Hypergraph Languages of Bounded Degree. J. Comput. Syst. Sci. Joost Engelfriet, Linda Heyker
1994	J	`jnl`	The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. Joost Engelfriet, Heiko Vogler
1993	B	`conf`	A Multiset Semantics for the pi-Calculus with Replication. CONCUR Joost Engelfriet
1993	J	`jnl`	Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci. Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
1993	J	`jnl`	X-Automata on omega-Words. Theor. Comput. Sci. Joost Engelfriet, Hendrik Jan Hoogeboom
1992	A*	`conf`	A Greibach Normal Form for Context-free Graph Grammars. ICALP Joost Engelfriet
1992	J	`jnl`	An Elementary Proof of Double Greibach Normal Form. Inf. Process. Lett. Joost Engelfriet
1992	J	`jnl`	Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. Acta Informatica Joost Engelfriet, Linda Heyker
1991	J	`jnl`	A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theor. Comput. Sci. Joost Engelfriet
1991	J	`jnl`	Branching Processes of Petri Nets. Acta Informatica Joost Engelfriet
1991	J	`jnl`	Iterated Stack Automata and Complexity Classes Inf. Comput. Joost Engelfriet
1991	J	`jnl`	Modular Tree Transducers. Theor. Comput. Sci. Joost Engelfriet, Heiko Vogler
1991	J	`jnl`	Nonterminal Separation in Graph Grammars. Theor. Comput. Sci. Joost Engelfriet, George Leih, Grzegorz Rozenberg
1991	J	`jnl`	The String Generating Power of Context-Free Hypergraph Grammars. J. Comput. Syst. Sci. Joost Engelfriet, Linda Heyker
1990	—	`conf`	A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees. Graph-Grammars and Their Application to Computer Science Joost Engelfriet
1990	J	`jnl`	A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars Inf. Comput. Joost Engelfriet, Grzegorz Rozenberg
1990	J	`jnl`	Attribute Storage Optimization by Stacks. Acta Informatica Joost Engelfriet, Willem de Jong
1990	J	`jnl`	Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. Joost Engelfriet, George Leih, Emo Welzl
1990	J	`jnl`	Complexity of boundary graph languages. RAIRO Theor. Informatics Appl. Joost Engelfriet, George Leih
1990	—	`conf`	Context-free Handle-rewriting Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
1990	—	`conf`	Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars. Graph-Grammars and Their Application to Computer Science Joost Engelfriet, Grzegorz Rozenberg
1990	—	`conf`	Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs. REX Workshop Joost Engelfriet, George Leih, Grzegorz Rozenberg
1990	J	`jnl`	The Complexity of Regular DNLC Graph Languages. J. Comput. Syst. Sci. IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg
1990	—	`conf`	The Term Generating Power of Context-Free Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science Joost Engelfriet, Linda Heyker
1989	A*	`conf`	Automata with Storage on Infinite Words. ICALP Joost Engelfriet, Hendrik Jan Hoogeboom
1989	B	`conf`	Context-Free NCE Graph Grammars. FCT Joost Engelfriet
1989	J	`jnl`	Linear Graph Grammars: Power and Complexity Inf. Comput. Joost Engelfriet, George Leih
1989	J	`jnl`	Passes, sweeps, and visits in attribute grammars. J. ACM Joost Engelfriet, Gilberto Filé
1989	J	`jnl`	The Power to Two-Way Deterministic Checking Stack Automata Inf. Comput. Joost Engelfriet
1989	J	`jnl`	The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction. SIGACT News Joost Engelfriet
1988	J	`jnl`	Apex Graph Grammars and Attribute Grammars. Acta Informatica Joost Engelfriet, George Leih, Grzegorz Rozenberg
1988	J	`jnl`	High Level Tree Transducers and Iterated Pushdown Tree Transducers. Acta Informatica Joost Engelfriet, Heiko Vogler
1988	J	`jnl`	Nonterminal Bounded NLC Graph Grammars. Theor. Comput. Sci. Joost Engelfriet, George Leih
1988	J	`jnl`	Prefix and Equality Languages of Rational Functions are Co-Context-Free. Inf. Process. Lett. Joost Engelfriet, Hendrik Jan Hoogeboom
1987	J	`jnl`	Look-Ahead on Pushdowns Inf. Comput. Joost Engelfriet, Heiko Vogler
1986	—	`conf`	Apex Graph Grammars. Graph-Grammars and Their Application to Computer Science Joost Engelfriet, George Leih, Grzegorz Rozenberg
1986	J	`jnl`	Pushdown Machines for the Macro Tree Transducer. Theor. Comput. Sci. Joost Engelfriet, Heiko Vogler
1986	—	`conf`	Restricting the complexity of regular DNLC languages. Graph-Grammars and Their Application to Computer Science IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg
1986	J	`jnl`	The complexity of Languages Generated by Attribute Grammars. SIAM J. Comput. Joost Engelfriet
1985	A*	`conf`	Characterization of High Level Tree Transducers. ICALP Joost Engelfriet, Heiko Vogler
1985	J	`jnl`	Determinacy - (Observation Equivalence = Trace Equivalence). Theor. Comput. Sci. Joost Engelfriet
1985	J	`jnl`	Hierarchies of Hyper-AFLs. J. Comput. Syst. Sci. Joost Engelfriet
1985	J	`jnl`	Macro Tree Transducers. J. Comput. Syst. Sci. Joost Engelfriet, Heiko Vogler
1985	J	`jnl`	The non-computability of computability. Bull. EATCS Joost Engelfriet
1984	J	`jnl`	Extended Macro Grammars and Stack Controlled Machines. J. Comput. Syst. Sci. Joost Engelfriet, Giora Slutzki
1984	—	`conf`	Regular Characterizations of Macro Tree Transducers. CAAP Joost Engelfriet, Heiko Vogler
1983	—	`conf`	Attribute Grammars: Attribute Evaluation Methods. Method and tools for compiler construction Joost Engelfriet
1983	J	`jnl`	Context Free Normal Systems and ETOL Systems. J. Comput. Syst. Sci. Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
1983	A*	`conf`	Iterated Pushdown Automata and Complexity Classes STOC Joost Engelfriet
1982	J	`jnl`	Simple Multi-Visit Attribute Grammars. J. Comput. Syst. Sci. Joost Engelfriet, Gilberto Filé
1982	J	`jnl`	The Copying Power of One-State Tree Transducers. J. Comput. Syst. Sci. Joost Engelfriet, Sven Skyum
1982	J	`jnl`	Three Hierarchies of Transducers. Math. Syst. Theory Joost Engelfriet
1981	J	`jnl`	A Tranlsational Theorem for the Class of EOL Languages Inf. Control. Joost Engelfriet, Grzegorz Rozenberg
1981	J	`jnl`	Passes and Paths of Attributive Grammars Inf. Control. Joost Engelfriet, Gilberto Filé
1981	A*	`conf`	Passes, Sweeps and Visits. ICALP Joost Engelfriet, Gilberto Filé
1981	J	`jnl`	The Formal Power of One-Visit Attribute Grammars. Acta Informatica Joost Engelfriet, Gilberto Filé
1980	J	`jnl`	Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. J. ACM Joost Engelfriet, Grzegorz Rozenberg
1980	A*	`conf`	Formal Properties of One-Visit and Multi-Pass Attribute Grammars. ICALP Joost Engelfriet, Gilberto Filé
1980	J	`jnl`	Stack Machines and Classes of Nonnested Macro Languages. J. ACM Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen
1980	J	`jnl`	Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki
1979	J	`jnl`	Bounded Nesting in Macro Grammars Inf. Control. Joost Engelfriet, Giora Slutzki
1979	J	`jnl`	Equality Languages and Fixed Point Languages Inf. Control. Joost Engelfriet, Grzegorz Rozenberg
1979	J	`jnl`	Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. Acta Informatica Peter R. J. Asveld, Joost Engelfriet
1978	A*	`conf`	Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages FOCS Joost Engelfriet, Grzegorz Rozenberg
1978	J	`jnl`	IO and OI. II. J. Comput. Syst. Sci. Joost Engelfriet, Erik Meineche Schmidt
1978	J	`jnl`	On Tree Transducers for Partial Functions. Inf. Process. Lett. Joost Engelfriet
1978	A*	`conf`	Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) STOC Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki
1977	J	`jnl`	IO and OI. I. J. Comput. Syst. Sci. Joost Engelfriet, Erik Meineche Schmidt
1977	J	`jnl`	Iterated Deterministic Substitution. Acta Informatica Peter R. J. Asveld, Joost Engelfriet
1977	J	`jnl`	Iterating Iterated Substitution. Theor. Comput. Sci. Joost Engelfriet
1977	A*	`conf`	Macro Grammars, Lindenmayer Systems and Other Copying Devices. ICALP Joost Engelfriet
1977	J	`jnl`	Top-down Tree Transducers with Regular Look-ahead. Math. Syst. Theory Joost Engelfriet
1976	J	`jnl`	Copying Theorems. Inf. Process. Lett. Joost Engelfriet, Sven Skyum
1976	J	`jnl`	Surface Tree Languages and Parallel Derivation Trees. Theor. Comput. Sci. Joost Engelfriet
1975	J	`jnl`	Bottom-up and Top-down Tree Transformations - A Comparison. Math. Syst. Theory Joost Engelfriet
1974	—	`book`	Simple Program Schemes and Formal Languages Joost Engelfriet
1972	J	`jnl`	A Note on Infinite Trees. Inf. Process. Lett. Joost Engelfriet
1972	A*	`conf`	Translation of Simple Program Schemes. ICALP Joost Engelfriet