Translation of Simple Program Schemes. - Joost Engelfriet (ICALP, 1972)

A Note on Infinite Trees. - Joost Engelfriet (Inf. Process. Lett., 1972)

Simple Program Schemes and Formal Languages - Joost Engelfriet (Springer, 1974)

Bottom-up and Top-down Tree Transformations - A Comparison. - Joost Engelfriet (Math. Syst. Theory, 1975)

Copying Theorems. - Joost Engelfriet; Sven Skyum (Inf. Process. Lett., 1976)

Surface Tree Languages and Parallel Derivation Trees. - Joost Engelfriet (Theor. Comput. Sci., 1976)

Macro Grammars, Lindenmayer Systems and Other Copying Devices. - Joost Engelfriet (ICALP, 1977)

Iterated Deterministic Substitution. - Peter R. J. Asveld; Joost Engelfriet (Acta Informatica, 1977)

IO and OI. I. - Joost Engelfriet; Erik Meineche Schmidt (J. Comput. Syst. Sci., 1977)

Top-down Tree Transducers with Regular Look-ahead. - Joost Engelfriet (Math. Syst. Theory, 1977)

Iterating Iterated Substitution. - Joost Engelfriet (Theor. Comput. Sci., 1977)

Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages - Joost Engelfriet; Grzegorz Rozenberg (FOCS, 1978)

Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) - Joost Engelfriet; Grzegorz Rozenberg; Giora Slutzki (STOC, 1978)

On Tree Transducers for Partial Functions. - Joost Engelfriet (Inf. Process. Lett., 1978)

IO and OI. II. - Joost Engelfriet; Erik Meineche Schmidt (J. Comput. Syst. Sci., 1978)

Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. - Peter R. J. Asveld; Joost Engelfriet (Acta Informatica, 1979)

Bounded Nesting in Macro Grammars - Joost Engelfriet; Giora Slutzki (Inf. Control., 1979)

Equality Languages and Fixed Point Languages - Joost Engelfriet; Grzegorz Rozenberg (Inf. Control., 1979)

Formal Properties of One-Visit and Multi-Pass Attribute Grammars. - Joost Engelfriet; Gilberto Filé (ICALP, 1980)

Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. - Joost Engelfriet; Grzegorz Rozenberg (J. ACM, 1980)

Stack Machines and Classes of Nonnested Macro Languages. - Joost Engelfriet; Erik Meineche Schmidt; Jan van Leeuwen (J. ACM, 1980)

Tree Transducers, L Systems, and Two-Way Machines. - Joost Engelfriet; Grzegorz Rozenberg; Giora Slutzki (J. Comput. Syst. Sci., 1980)

Passes, Sweeps and Visits. - Joost Engelfriet; Gilberto Filé (ICALP, 1981)

The Formal Power of One-Visit Attribute Grammars. - Joost Engelfriet; Gilberto Filé (Acta Informatica, 1981)

Passes and Paths of Attributive Grammars - Joost Engelfriet; Gilberto Filé (Inf. Control., 1981)

A Tranlsational Theorem for the Class of EOL Languages - Joost Engelfriet; Grzegorz Rozenberg (Inf. Control., 1981)

Simple Multi-Visit Attribute Grammars. - Joost Engelfriet; Gilberto Filé (J. Comput. Syst. Sci., 1982)

The Copying Power of One-State Tree Transducers. - Joost Engelfriet; Sven Skyum (J. Comput. Syst. Sci., 1982)

Three Hierarchies of Transducers. - Joost Engelfriet (Math. Syst. Theory, 1982)

Attribute Grammars: Attribute Evaluation Methods. - Joost Engelfriet (Method and tools for compiler construction, 1983)

Iterated Pushdown Automata and Complexity Classes - Joost Engelfriet (STOC, 1983)

Context Free Normal Systems and ETOL Systems. - Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1983)

Regular Characterizations of Macro Tree Transducers. - Joost Engelfriet; Heiko Vogler (CAAP, 1984)

Extended Macro Grammars and Stack Controlled Machines. - Joost Engelfriet; Giora Slutzki (J. Comput. Syst. Sci., 1984)

Characterization of High Level Tree Transducers. - Joost Engelfriet; Heiko Vogler (ICALP, 1985)

The non-computability of computability. - Joost Engelfriet (Bull. EATCS, 1985)

Hierarchies of Hyper-AFLs. - Joost Engelfriet (J. Comput. Syst. Sci., 1985)

Macro Tree Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1985)

Determinacy - (Observation Equivalence = Trace Equivalence). - Joost Engelfriet (Theor. Comput. Sci., 1985)

Restricting the complexity of regular DNLC languages. - IJsbrand Jan Aalbersberg; Joost Engelfriet; Grzegorz Rozenberg (Graph-Grammars and Their Application to Computer Science, 1986)

Apex Graph Grammars. - Joost Engelfriet; George Leih; Grzegorz Rozenberg (Graph-Grammars and Their Application to Computer Science, 1986)

The complexity of Languages Generated by Attribute Grammars. - Joost Engelfriet (SIAM J. Comput., 1986)

Pushdown Machines for the Macro Tree Transducer. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1986)

Corrigenda: Pushdown Machines for the Macro Tree Tranducer. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1986)

Look-Ahead on Pushdowns - Joost Engelfriet; Heiko Vogler (Inf. Comput., 1987)

Apex Graph Grammars and Attribute Grammars. - Joost Engelfriet; George Leih; Grzegorz Rozenberg (Acta Informatica, 1988)

High Level Tree Transducers and Iterated Pushdown Tree Transducers. - Joost Engelfriet; Heiko Vogler (Acta Informatica, 1988)

Prefix and Equality Languages of Rational Functions are Co-Context-Free. - Joost Engelfriet; Hendrik Jan Hoogeboom (Inf. Process. Lett., 1988)

Nonterminal Bounded NLC Graph Grammars. - Joost Engelfriet; George Leih (Theor. Comput. Sci., 1988)

Context-Free NCE Graph Grammars. - Joost Engelfriet (FCT, 1989)

Automata with Storage on Infinite Words. - Joost Engelfriet; Hendrik Jan Hoogeboom (ICALP, 1989)

Passes, sweeps, and visits in attribute grammars. - Joost Engelfriet; Gilberto Filé (J. ACM, 1989)

The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction. - Joost Engelfriet (SIGACT News, 1989)

The Power to Two-Way Deterministic Checking Stack Automata - Joost Engelfriet (Inf. Comput., 1989)

Linear Graph Grammars: Power and Complexity - Joost Engelfriet; George Leih (Inf. Comput., 1989)

Context-free Handle-rewriting Hypergraph Grammars. - Bruno Courcelle; Joost Engelfriet; Grzegorz Rozenberg (Graph-Grammars and Their Application to Computer Science, 1990)

A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees. - Joost Engelfriet (Graph-Grammars and Their Application to Computer Science, 1990)

The Term Generating Power of Context-Free Hypergraph Grammars. - Joost Engelfriet; Linda Heyker (Graph-Grammars and Their Application to Computer Science, 1990)

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars. - Joost Engelfriet; Grzegorz Rozenberg (Graph-Grammars and Their Application to Computer Science, 1990)

Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs. - Joost Engelfriet; George Leih; Grzegorz Rozenberg (REX Workshop, 1990)

Attribute Storage Optimization by Stacks. - Joost Engelfriet; Willem de Jong (Acta Informatica, 1990)

Complexity of boundary graph languages. - Joost Engelfriet; George Leih (RAIRO Theor. Informatics Appl., 1990)

The Complexity of Regular DNLC Graph Languages. - IJsbrand Jan Aalbersberg; Joost Engelfriet; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1990)

Boundary Graph Grammars with Dynamic Edge Relabeling. - Joost Engelfriet; George Leih; Emo Welzl (J. Comput. Syst. Sci., 1990)

A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars - Joost Engelfriet; Grzegorz Rozenberg (Inf. Comput., 1990)

Branching Processes of Petri Nets. - Joost Engelfriet (Acta Informatica, 1991)

The String Generating Power of Context-Free Hypergraph Grammars. - Joost Engelfriet; Linda Heyker (J. Comput. Syst. Sci., 1991)

A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. - Joost Engelfriet (Theor. Comput. Sci., 1991)

Nonterminal Separation in Graph Grammars. - Joost Engelfriet; George Leih; Grzegorz Rozenberg (Theor. Comput. Sci., 1991)

Modular Tree Transducers. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1991)

Iterated Stack Automata and Complexity Classes - Joost Engelfriet (Inf. Comput., 1991)

A Greibach Normal Form for Context-free Graph Grammars. - Joost Engelfriet (ICALP, 1992)

Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. - Joost Engelfriet; Linda Heyker (Acta Informatica, 1992)

An Elementary Proof of Double Greibach Normal Form. - Joost Engelfriet (Inf. Process. Lett., 1992)

Handle-Rewriting Hypergraph Grammars. - Bruno Courcelle; Joost Engelfriet; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1993)

X-Automata on omega-Words. - Joost Engelfriet; Hendrik Jan Hoogeboom (Theor. Comput. Sci., 1993)

Deciding the NTS Property of Context-Free Grammars. - Joost Engelfriet (Results and Trends in Theoretical Computer Science, 1994)

Graph Grammars and Tree Transducers. - Joost Engelfriet (CAAP, 1994)

Concatenation of Graphs. - Joost Engelfriet; Jan Joris Vereijken (TAGT, 1994)

Domino Treewith (Extended Abstract). - Hans L. Bodlaender; Joost Engelfriet (WG, 1994)

Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. - Joost Engelfriet; Linda Heyker; George Leih (Acta Informatica, 1994)

Hypergraph Languages of Bounded Degree. - Joost Engelfriet; Linda Heyker (J. Comput. Syst. Sci., 1994)

The Translation Power of Top-Down Tree-to-Graph Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1994)

Grammatical Codes of Trees and Terminally Coded Grammars. - Andrzej Ehrenfeucht; Joost Engelfriet; Paulien ten Pas; Grzegorz Rozenberg (Fundam. Informaticae, 1995)

A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. - Bruno Courcelle; Joost Engelfriet (Math. Syst. Theory, 1995)

Elementary Net Systems. - Grzegorz Rozenberg; Joost Engelfriet (Petri Nets, 1996)

Reverse Twin Shuffles. - Joost Engelfriet (Bull. EATCS, 1996)

Finite Languages for the Representation of Finite Graphs. - Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1996)

Regular Description of Context-Free Graph Languages. - Joost Engelfriet; Vincent van Oostrom (J. Comput. Syst. Sci., 1996)

A Multiset Semantics for the pi-Calculus with Replication. - Joost Engelfriet (Theor. Comput. Sci., 1996)

Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. - Joost Engelfriet; Tero Harju; Andrzej Proskurowski; Grzegorz Rozenberg (Theor. Comput. Sci., 1996)

Monadic Second Order Logic and Node Relations on Graphs and Trees. - Roderick Bloem; Joost Engelfriet (Structures in Logic and Computer Science, 1997)

Node Replacement Graph Grammars. - Joost Engelfriet; Grzegorz Rozenberg (Handbook of Graph Grammars, 1997)

Context-Free Graph Grammars and Concatenation of Graphs. - Joost Engelfriet; Jan Joris Vereijken (Acta Informatica, 1997)

Domino Treewidth. - Hans L. Bodlaender; Joost Engelfriet (J. Algorithms, 1997)

Logical Description of Contex-Free Graph Languages. - Joost Engelfriet; Vincent van Oostrom (J. Comput. Syst. Sci., 1997)

Context-Free Graph Grammars. - Joost Engelfriet (Handbook of Formal Languages (3), 1997)

Tree Languages Generated be Context-Free Graph Grammars. - Joost Engelfriet; Sebastian Maneth (TAGT, 1998)

Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. - Joost Engelfriet; Tjalling Gelsema (Acta Informatica, 1998)

Decidability of the Finiteness of Ranges of Tree Transductions. - Frank Drewes; Joost Engelfriet (Inf. Comput., 1998)

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1998)

Tree-Walking Pebble Automata. - Joost Engelfriet; Hendrik Jan Hoogeboom (Jewels are Forever, 1999)

Two-Way Finite State Transducers and Monadic Second-Order Logic. - Joost Engelfriet; Hendrik Jan Hoogeboom (ICALP, 1999)

Trips on Trees. - Joost Engelfriet; Hendrik Jan Hoogeboom; Jan-Pascal van Best (Acta Cybern., 1999)

Derivation Trees of Ground Term Rewriting Systems. - Joost Engelfriet (Inf. Comput., 1999)

Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. - Joost Engelfriet; Sebastian Maneth (Inf. Comput., 1999)

Multisets and Structural Congruence of the pi-Calculus with Replication. - Joost Engelfriet; Tjalling Gelsema (Theor. Comput. Sci., 1999)

Characterizing and Deciding MSO-Definability of Macro Tree Transductions. - Joost Engelfriet; Sebastian Maneth (STACS, 2000)

A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars. - Roderick Bloem; Joost Engelfriet (J. Comput. Syst. Sci., 2000)

Hierarchies of String Languages Generated by Deterministic Tree Transducers. - Joost Engelfriet; Sebastian Maneth (Developments in Language Theory, 2001)

Structural inclusion in the pi-calculus with replication. - Joost Engelfriet; Tjalling Gelsema (Theor. Comput. Sci., 2001)

MSO definable string transductions and two-way finite-state transducers. - Joost Engelfriet; Hendrik Jan Hoogeboom (ACM Trans. Comput. Log., 2001)

The Delta Operation: From Strings to Trees to Strings. - Joost Engelfriet (Formal and Natural Computing, 2002)

Two-Way Finite State Transducers with Nested Pebbles. - Joost Engelfriet; Sebastian Maneth (MFCS, 2002)

Bottom-Up and Top-Down Tree Series Transformations. - Joost Engelfriet; Zoltán Fülöp 001; Heiko Vogler (J. Autom. Lang. Comb., 2002)

Output String Languages of Compositions of Deterministic Macro Tree Transducers. - Joost Engelfriet; Sebastian Maneth (J. Comput. Syst. Sci., 2002)

Branching Grammars: A Generalization of ET0L Systems. - Frank Drewes; Joost Engelfriet (Developments in Language Theory, 2003)

A comparison of pebble tree transducers with macro tree transducers. - Joost Engelfriet; Sebastian Maneth (Acta Informatica, 2003)

Macro Tree Translations of Linear Size Increase are MSO Definable. - Joost Engelfriet; Sebastian Maneth (SIAM J. Comput., 2003)

A new natural structural congruence in the pi-calculus with replication. - Joost Engelfriet; Tjalling Gelsema (Acta Informatica, 2004)

Branching synchronization grammars with nested tables. - Frank Drewes; Joost Engelfriet (J. Comput. Syst. Sci., 2004)

Clique-Width for Four-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (FCT, 2005)

Nested Pebbles and Transitive Closure. - Joost Engelfriet; Hendrik Jan Hoogeboom (STACS, 2006)

The equivalence problem for deterministic MSO tree transducers is decidable. - Joost Engelfriet; Sebastian Maneth (Inf. Process. Lett., 2006)

Clique-Width for 4-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (Theory Comput. Syst., 2006)

XML transformation by tree-walking transducers with invisible pebbles. - Joost Engelfriet; Hendrik Jan Hoogeboom; Bart Samwel (PODS, 2007)

Finitary Compositions of Two-way Finite-State Transductions. - Joost Engelfriet; Hendrik Jan Hoogeboom (Fundam. Informaticae, 2007)

A Kleene characterization of computability. - Joost Engelfriet (Inf. Process. Lett., 2007)

An exercise in structural congruence. - Joost Engelfriet; Tjalling Gelsema (Inf. Process. Lett., 2007)

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. - Joost Engelfriet; Hendrik Jan Hoogeboom (Log. Methods Comput. Sci., 2007)

The time complexity of typechecking tree-walking tree transducers. - Joost Engelfriet (Acta Informatica, 2009)

Extended multi bottom-up tree transducers. - Joost Engelfriet; Eric Lilin; Andreas Maletti (Acta Informatica, 2009)

Deciding equivalence of top-down XML transformations in polynomial time. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (J. Comput. Syst. Sci., 2009)

Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. - Bruno Courcelle; Joost Engelfriet (Cambridge University Press, 2012)

Strong Lexicalization of Tree Adjoining Grammars. - Andreas Maletti; Joost Engelfriet (ACL (1), 2012)

Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. - Bruno Courcelle; Joost Engelfriet (Bull. EATCS, 2012)

Determinacy and Rewriting of Top-Down and MSO Tree Transformations. - Michael Benedikt; Joost Engelfriet; Sebastian Maneth (MFCS, 2013)

Look-Ahead Removal for Top-Down Tree Transducers. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (CoRR, 2013)

How to Remove the Look-Ahead of Top-Down Tree Transducers. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (Developments in Language Theory, 2014)

Context-Free Grammars with Storage. - Joost Engelfriet (CoRR, 2014)

Two-way pebble transducers for partial functions and their composition. - Joost Engelfriet (Acta Informatica, 2015)

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. - Frank Drewes; Joost Engelfriet (Acta Cybern., 2015)

Tree Automata and Tree Grammars. - Joost Engelfriet (CoRR, 2015)

The generative power of delegation networks. - Frank Drewes; Joost Engelfriet (Inf. Comput., 2015)

Erratum to: "Top-down Tree Transducers with Regular Look-ahead". - Joost Engelfriet (Theory Comput. Syst., 2016)

Look-ahead removal for total deterministic top-down tree transducers. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (Theor. Comput. Sci., 2016)

Equivalence - Combinatorics, Algebra, Proofs. - Helmut Seidl; Sebastian Maneth; Gregor Kemper; Joost Engelfriet (Dependable Software Systems Engineering, 2016)

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. - Joost Engelfriet; Andreas Maletti (FCT, 2017)

The Trees of Hanoi. - Joost Engelfriet (CoRR, 2017)

Determinacy and rewriting of functional top-down and MSO tree transformations. - Michael Benedikt; Joost Engelfriet; Sebastian Maneth (J. Comput. Syst. Sci., 2017)

Composition Closure of Linear Extended Top-down Tree Transducers. - Joost Engelfriet; Zoltán Fülöp 001; Andreas Maletti (Theory Comput. Syst., 2017)

Multiple context-free tree grammars: Lexicalization and characterization. - Joost Engelfriet; Andreas Maletti; Sebastian Maneth (Theor. Comput. Sci., 2018)

Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]. - Joost Engelfriet (Inf. Comput., 2019)

A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. - Joost Engelfriet; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2020)

Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. - Joost Engelfriet; Kazuhiro Inaba; Sebastian Maneth (Acta Informatica, 2021)

Computability by monadic second-order logic. - Joost Engelfriet (Inf. Process. Lett., 2021)

XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. - Joost Engelfriet; Hendrik Jan Hoogeboom; Bart Samwel (Theor. Comput. Sci., 2021)