Joost Engelfriet

Publication Activity (10 Years)

Years Active: 1972-2021
Publications (10 Years): 17

Top Venues

CoRR

Theor. Comput. Sci.

Theory Comput. Syst.

Acta Informatica

Publications

Joost Engelfriet
Computability by monadic second-order logic. Inf. Process. Lett. 167 (2021)
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Theor. Comput. Sci. 850 (2021)
Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica 58 (1-2) (2021)
Joost Engelfriet, Heiko Vogler
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Joost Engelfriet
Computability by Monadic Second-Order Logic. CoRR (2020)
Joost Engelfriet, Heiko Vogler
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. CoRR (2019)
Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. CoRR (2019)
Joost Engelfriet
Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]. Inf. Comput. 267 (2019)
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. CoRR (2018)
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. 728 (2018)
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. 85 (2017)
Joost Engelfriet, Andreas Maletti
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT (2017)
Joost Engelfriet
The Trees of Hanoi. CoRR (2017)
Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60 (2) (2017)
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR (2017)
Joost Engelfriet
Erratum to: "Top-down Tree Transducers with Regular Look-ahead". Theory Comput. Syst. 58 (2) (2016)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616 (2016)
Frank Drewes, Joost Engelfriet
The generative power of delegation networks. Inf. Comput. 245 (2015)
Joost Engelfriet
Tree Automata and Tree Grammars. CoRR (2015)
Frank Drewes, Joost Engelfriet
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. 22 (2) (2015)
Joost Engelfriet
Two-way pebble transducers for partial functions and their composition. Acta Informatica 52 (7-8) (2015)
Joost Engelfriet
Context-Free Grammars with Storage. CoRR (2014)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory (2014)
Michael Benedikt, Joost Engelfriet, Sebastian Maneth
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. MFCS (2013)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Look-Ahead Removal for Top-Down Tree Transducers. CoRR (2013)
Bruno Courcelle, Joost Engelfriet
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Bull. EATCS 108 (2012)
Andreas Maletti, Joost Engelfriet
Strong Lexicalization of Tree Adjoining Grammars. ACL (1) (2012)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75 (5) (2009)
Joost Engelfriet, Eric Lilin, Andreas Maletti
Extended multi bottom-up tree transducers. Acta Informatica 46 (8) (2009)
Joost Engelfriet
The time complexity of typechecking tree-walking tree transducers. Acta Informatica 46 (2) (2009)
Joost Engelfriet, Eric Lilin, Andreas Maletti
Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory (2008)
Joost Engelfriet, Hendrik Jan Hoogeboom
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Log. Methods Comput. Sci. 3 (2) (2007)
Joost Engelfriet, Tjalling Gelsema
An exercise in structural congruence. Inf. Process. Lett. 101 (1) (2007)
Joost Engelfriet
A Kleene characterization of computability. Inf. Process. Lett. 101 (4) (2007)
Joost Engelfriet, Hendrik Jan Hoogeboom
Finitary Compositions of Two-way Finite-State Transductions. Fundam. Informaticae 80 (1-3) (2007)
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
XML transformation by tree-walking transducers with invisible pebbles. PODS (2007)
Joost Engelfriet, Hendrik Jan Hoogeboom
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure CoRR (2007)
Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39 (4) (2006)
Joost Engelfriet, Sebastian Maneth
The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100 (5) (2006)
Joost Engelfriet, Hendrik Jan Hoogeboom
Nested Pebbles and Transitive Closure. STACS (2006)
Joost Engelfriet, Sebastian Maneth
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS (2005)
Joost Engelfriet, Sebastian Maneth
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable CoRR (2005)
Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT (2005)
Joost Engelfriet, Tjalling Gelsema
A new natural structural congruence in the pi-calculus with replication. Acta Informatica 40 (6-7) (2004)
Frank Drewes, Joost Engelfriet
Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. 68 (3) (2004)
Frank Drewes, Joost Engelfriet
Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory (2003)
Joost Engelfriet, Sebastian Maneth
A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39 (9) (2003)
Joost Engelfriet, Sebastian Maneth
Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32 (4) (2003)
Joost Engelfriet
The Delta Operation: From Strings to Trees to Strings. Formal and Natural Computing (2002)
Joost Engelfriet, Zoltán Fülöp, Heiko Vogler
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7 (1) (2002)
Joost Engelfriet, Sebastian Maneth
Two-Way Finite State Transducers with Nested Pebbles. MFCS (2002)
Joost Engelfriet, Sebastian Maneth
Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64 (2) (2002)
Joost Engelfriet, Tjalling Gelsema
Structural inclusion in the pi-calculus with replication. Theor. Comput. Sci. 258 (1-2) (2001)
Joost Engelfriet, Hendrik Jan Hoogeboom
MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2 (2) (2001)
Joost Engelfriet, Sebastian Maneth
Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory (2001)
Joost Engelfriet, Sebastian Maneth
Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS (2000)
Roderick Bloem, Joost Engelfriet
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars. J. Comput. Syst. Sci. 61 (1) (2000)
Joost Engelfriet
Derivation Trees of Ground Term Rewriting Systems. Inf. Comput. 152 (1) (1999)
Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal van Best
Trips on Trees. Acta Cybern. 14 (1) (1999)
Joost Engelfriet, Sebastian Maneth
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154 (1) (1999)
Joost Engelfriet, Tjalling Gelsema
Multisets and Structural Congruence of the pi-Calculus with Replication. Theor. Comput. Sci. 211 (1-2) (1999)
Joost Engelfriet, Hendrik Jan Hoogeboom
MSO definable string transductions and two-way finite state transducers CoRR (1999)
Joost Engelfriet, Hendrik Jan Hoogeboom
Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP (1999)
Joost Engelfriet, Hendrik Jan Hoogeboom
Tree-Walking Pebble Automata. Jewels are Forever (1999)
Joost Engelfriet, Tjalling Gelsema
Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. Acta Informatica 35 (12) (1998)
Joost Engelfriet, Heiko Vogler
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 56 (3) (1998)
Frank Drewes, Joost Engelfriet
Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. 145 (1) (1998)
Joost Engelfriet, Sebastian Maneth
Tree Languages Generated be Context-Free Graph Grammars. TAGT (1998)
Joost Engelfriet, Vincent van Oostrom
Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55 (3) (1997)
Roderick Bloem, Joost Engelfriet
Monadic Second Order Logic and Node Relations on Graphs and Trees. Structures in Logic and Computer Science (1997)
Joost Engelfriet, Jan Joris Vereijken
Context-Free Graph Grammars and Concatenation of Graphs. Acta Informatica 34 (10) (1997)
Hans L. Bodlaender, Joost Engelfriet
Domino Treewidth. J. Algorithms 24 (1) (1997)
Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg
Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. 52 (1) (1996)
Joost Engelfriet
A Multiset Semantics for the pi-Calculus with Replication. Theor. Comput. Sci. 153 (1&2) (1996)
Joost Engelfriet, Vincent van Oostrom
Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. 53 (3) (1996)
Joost Engelfriet
Reverse Twin Shuffles. Bull. EATCS 60 (1996)
Grzegorz Rozenberg, Joost Engelfriet
Elementary Net Systems. Petri Nets (1996)
Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154 (2) (1996)
Bruno Courcelle, Joost Engelfriet
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28 (6) (1995)
Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg
Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Informaticae 23 (1) (1995)
Joost Engelfriet
Deciding the NTS Property of Context-Free Grammars. Results and Trends in Theoretical Computer Science (1994)
Hans L. Bodlaender, Joost Engelfriet
Domino Treewith (Extended Abstract). WG (1994)
Joost Engelfriet, Linda Heyker
Hypergraph Languages of Bounded Degree. J. Comput. Syst. Sci. 48 (1) (1994)
Joost Engelfriet, Jan Joris Vereijken
Concatenation of Graphs. TAGT (1994)
Joost Engelfriet
Graph Grammars and Tree Transducers. CAAP (1994)
Joost Engelfriet, Linda Heyker, George Leih
Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. Acta Informatica 31 (4) (1994)
Joost Engelfriet, Heiko Vogler
The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49 (2) (1994)
Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci. 46 (2) (1993)
Joost Engelfriet, Hendrik Jan Hoogeboom
X-Automata on omega-Words. Theor. Comput. Sci. 110 (1) (1993)
Joost Engelfriet
A Multiset Semantics for the pi-Calculus with Replication. CONCUR (1993)
Joost Engelfriet, Linda Heyker
Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. Acta Informatica 29 (2) (1992)
Joost Engelfriet
A Greibach Normal Form for Context-free Graph Grammars. ICALP (1992)
Joost Engelfriet
An Elementary Proof of Double Greibach Normal Form. Inf. Process. Lett. 44 (6) (1992)
Joost Engelfriet, Heiko Vogler
Modular Tree Transducers. Theor. Comput. Sci. 78 (2) (1991)
Joost Engelfriet
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theor. Comput. Sci. 88 (1) (1991)
Joost Engelfriet, Linda Heyker
The String Generating Power of Context-Free Hypergraph Grammars. J. Comput. Syst. Sci. 43 (2) (1991)
Joost Engelfriet
Branching Processes of Petri Nets. Acta Informatica 28 (6) (1991)
Joost Engelfriet
Iterated Stack Automata and Complexity Classes Inf. Comput. 95 (1) (1991)
Joost Engelfriet, George Leih, Grzegorz Rozenberg
Nonterminal Separation in Graph Grammars. Theor. Comput. Sci. 82 (1) (1991)
Joost Engelfriet, Willem de Jong
Attribute Storage Optimization by Stacks. Acta Informatica 27 (6) (1990)

Joost Engelfriet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joost Engelfriet