| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joost Engelfriet, Eric Lilin, Andreas Maletti |
Extended multi bottom-up tree transducers.  |
Acta Inf.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
The time complexity of typechecking tree-walking tree transducers. |
Acta Inf. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth, Helmut Seidl |
Deciding equivalence of top-down XML transformations in polynomial time. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Eric Lilin, Andreas Maletti |
Extended Multi Bottom-Up Tree Transducers. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Tjalling Gelsema |
An exercise in structural congruence. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Kleene characterization of computability. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Finitary Compositions of Two-way Finite-State Transductions. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML transformation by tree-walking transducers with invisible pebbles. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
tree transducer, XML, pebble |
| 1 | Joost Engelfriet, Sebastian Maneth |
The equivalence problem for deterministic MSO tree transducers is decidable. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for 4-Vertex Forbidden Subgraphs. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Nested Pebbles and Transitive Closure. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for Four-Vertex Forbidden Subgraphs. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Tjalling Gelsema |
A new natural structural congruence in the pi-calculus with replication. |
Acta Inf. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Drewes, Joost Engelfriet |
Branching synchronization grammars with nested tables. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
A comparison of pebble tree transducers with macro tree transducers. |
Acta Inf. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Macro Tree Translations of Linear Size Increase are MSO Definable. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Drewes, Joost Engelfriet |
Branching Grammars: A Generalization of ET0L Systems. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Zoltán Fülöp, Heiko Vogler |
Bottom-Up and Top-Down Tree Series Transformations. |
Journal of Automata, Languages and Combinatorics |
2002 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Output String Languages of Compositions of Deterministic Macro Tree Transducers. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Two-Way Finite State Transducers with Nested Pebbles. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
The Delta Operation: From Strings to Trees to Strings. |
Formal and Natural Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Tjalling Gelsema |
Structural inclusion in the pi-calculus with replication. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
MSO definable string transductions and two-way finite-state transducers. |
ACM Trans. Comput. Log. |
2001 |
DBLP DOI BibTeX RDF |
Büchi, Elgot, Hennie machine, Trakhtenbrot, string transductions, two-way finite-state transducers, interpretation, monadic second-order logic |
| 1 | Joost Engelfriet, Sebastian Maneth |
Hierarchies of String Languages Generated by Deterministic Tree Transducers. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Roderick Bloem, Joost Engelfriet |
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Characterizing and Deciding MSO-Definability of Macro Tree Transductions. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best |
Trips on Trees. |
Acta Cybern. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Tjalling Gelsema |
Multisets and Structural Congruence of the pi-Calculus with Replication. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Derivation Trees of Ground Term Rewriting Systems. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
MSO definable string transductions and two-way finite state transducers |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Two-Way Finite State Transducers and Monadic Second-Order Logic. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Tree-Walking Pebble Automata. |
Jewels are Forever |
1999 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Tjalling Gelsema |
Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. |
Acta Inf. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Drewes, Joost Engelfriet |
Decidability of the Finiteness of Ranges of Tree Transductions. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Sebastian Maneth |
Tree Languages Generated be Context-Free Graph Grammars. |
TAGT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Jan Joris Vereijken |
Context-Free Graph Grammars and Concatenation of Graphs. |
Acta Inf. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Joost Engelfriet |
Domino Treewidth. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Vincent van Oostrom |
Logical Description of Contex-Free Graph Languages. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Grzegorz Rozenberg |
Node Replacement Graph Grammars. |
Handbook of Graph Grammars |
1997 |
DBLP BibTeX RDF |
|
| 1 | Roderick Bloem, Joost Engelfriet |
Monadic Second Order Logic and Node Relations on Graphs and Trees. |
Structures in Logic and Computer Science |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Multiset Semantics for the pi-Calculus with Replication. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg |
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Reverse Twin Shuffles. |
Bulletin of the EATCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Vincent van Oostrom |
Regular Description of Context-Free Graph Languages. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg |
Finite Languages for the Representation of Finite Graphs. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Grzegorz Rozenberg, Joost Engelfriet |
Elementary Net Systems. |
Petri Nets |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg |
Grammatical Codes of Trees and Terminally Coded Grammars. |
Fundam. Inform. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Joost Engelfriet |
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. |
Mathematical Systems Theory |
1995 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Linda Heyker, George Leih |
Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. |
Acta Inf. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
The Translation Power of Top-Down Tree-to-Graph Transducers. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Linda Heyker |
Hypergraph Languages of Bounded Degree. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Joost Engelfriet |
Domino Treewith (Extended Abstract). |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Graph Grammars and Tree Transducers. |
CAAP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Deciding the NTS Property of Context-Free Grammars. |
Results and Trends in Theoretical Computer Science |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Jan Joris Vereijken |
Concatenation of Graphs. |
TAGT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
X-Automata on omega-Words. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg |
Handle-Rewriting Hypergraph Grammars. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Multiset Semantics for the pi-Calculus with Replication. |
CONCUR |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
An Elementary Proof of Double Greibach Normal Form. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Linda Heyker |
Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. |
Acta Inf. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Greibach Normal Form for Context-free Graph Grammars. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
Modular Tree Transducers. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih, Grzegorz Rozenberg |
Nonterminal Separation in Graph Grammars. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Branching Processes of Petri Nets. |
Acta Inf. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Iterated Stack Automata and Complexity Classes |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Linda Heyker |
The String Generating Power of Context-Free Hypergraph Grammars. |
J. Comput. Syst. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih |
Complexity of boundary graph languages. |
ITA |
1990 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Grzegorz Rozenberg |
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars |
Inf. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih, Emo Welzl |
Boundary Graph Grammars with Dynamic Edge Relabeling. |
J. Comput. Syst. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg |
The Complexity of Regular DNLC Graph Languages. |
J. Comput. Syst. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg |
Context-free Handle-rewriting Hypergraph Grammars. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Grzegorz Rozenberg |
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Linda Heyker |
The Term Generating Power of Context-Free Hypergraph Grammars. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih, Grzegorz Rozenberg |
Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs. |
REX Workshop |
1990 |
DBLP DOI BibTeX RDF |
actor system, communication, Petri net, Parallel, observation, operational semantics, transition system, handshaking, object-based |
| 1 | Joost Engelfriet, Willem de Jong |
Attribute Storage Optimization by Stacks. |
Acta Inf. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
The Power to Two-Way Deterministic Checking Stack Automata |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih |
Linear Graph Grammars: Power and Complexity |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Gilberto Filé |
Passes, sweeps, and visits in attribute grammars. |
J. ACM |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction. |
SIGACT News |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Automata with Storage on Infinite Words. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Context-Free NCE Graph Grammars. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Prefix and Equality Languages of Rational Functions are Co-Context-Free. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih |
Nonterminal Bounded NLC Graph Grammars. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
High Level Tree Transducers and Iterated Pushdown Tree Transducers. |
Acta Inf. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih, Grzegorz Rozenberg |
Apex Graph Grammars and Attribute Grammars. |
Acta Inf. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
Look-Ahead on Pushdowns |
Inf. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
Pushdown Machines for the Macro Tree Transducer. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
Corrigenda: Pushdown Machines for the Macro Tree Tranducer. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
The complexity of Languages Generated by Attribute Grammars. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg |
Restricting the complexity of regular DNLC languages. |
Graph-Grammars and Their Application to Computer Science |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet, George Leih, Grzegorz Rozenberg |
Apex Graph Grammars. |
Graph-Grammars and Their Application to Computer Science |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Determinacy - (Observation Equivalence = Trace Equivalence). |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")