dblp.uni-trier.dewww.uni-trier.de

Joost Engelfriet Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
136EEJoost Engelfriet: The time complexity of typechecking tree-walking tree transducers. Acta Inf. 46(2): 139-154 (2009)
135EEJoost Engelfriet, Sebastian Maneth, Helmut Seidl: Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009)
2008
134EEJoost Engelfriet, Eric Lilin, Andreas Maletti: Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory 2008: 289-300
2007
133EEJoost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel: XML transformation by tree-walking transducers with invisible pebbles. PODS 2007: 63-72
132EEJoost Engelfriet, Hendrik Jan Hoogeboom: Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure CoRR abs/cs/0703079: (2007)
131EEJoost Engelfriet, Hendrik Jan Hoogeboom: Finitary Compositions of Two-way Finite-State Transductions. Fundam. Inform. 80(1-3): 111-123 (2007)
130EEJoost Engelfriet, Tjalling Gelsema: An exercise in structural congruence. Inf. Process. Lett. 101(1): 1-5 (2007)
129EEJoost Engelfriet: A Kleene characterization of computability. Inf. Process. Lett. 101(4): 139-140 (2007)
128EEJoost Engelfriet, Hendrik Jan Hoogeboom: Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Logical Methods in Computer Science 3(2): (2007)
2006
127EEJoost Engelfriet, Hendrik Jan Hoogeboom: Nested Pebbles and Transitive Closure. STACS 2006: 477-488
126EEJoost Engelfriet, Sebastian Maneth: The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5): 206-212 (2006)
125EEAndreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006)
2005
124EEAndreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
123EEJoost Engelfriet, Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005: 495-504
122EEJoost Engelfriet, Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable CoRR abs/cs/0506014: (2005)
2004
121EEJoost Engelfriet, Tjalling Gelsema: A new natural structural congruence in the pi-calculus with replication. Acta Inf. 40(6-7): 385-430 (2004)
120EEFrank Drewes, Joost Engelfriet: Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. 68(3): 611-656 (2004)
2003
119EEFrank Drewes, Joost Engelfriet: Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory 2003: 266-278
118EEJoost Engelfriet, Sebastian Maneth: A comparison of pebble tree transducers with macro tree transducers. Acta Inf. 39(9): 613-698 (2003)
117EEJoost Engelfriet, Sebastian Maneth: Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32(4): 950-1006 (2003)
2002
116EEJoost Engelfriet: The Delta Operation: From Strings to Trees to Strings. Formal and Natural Computing 2002: 39-56
115EEJoost Engelfriet, Sebastian Maneth: Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002: 234-244
114EEJoost Engelfriet, Sebastian Maneth: Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64(2): 350-395 (2002)
113 Joost Engelfriet, Zoltán Fülöp, Heiko Vogler: Bottom-Up and Top-Down Tree Series Transformations. Journal of Automata, Languages and Combinatorics 7(1): 11-70 (2002)
2001
112EEJoost Engelfriet, Sebastian Maneth: Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001: 228-238
111EEJoost Engelfriet, Hendrik Jan Hoogeboom: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2): 216-254 (2001)
110EEJoost Engelfriet, Tjalling Gelsema: Structural inclusion in the pi-calculus with replication. Theor. Comput. Sci. 258(1-2): 131-168 (2001)
2000
109EEJoost Engelfriet, Sebastian Maneth: Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000: 542-554
108 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): 1-50 (2000)
1999
107EEJoost Engelfriet, Hendrik Jan Hoogeboom: Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP 1999: 311-320
106 Joost Engelfriet, Hendrik Jan Hoogeboom: Tree-Walking Pebble Automata. Jewels are Forever 1999: 72-83
105EEJoost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best: Trips on Trees. Acta Cybern. 14(1): 51-64 (1999)
104EEJoost Engelfriet, Hendrik Jan Hoogeboom: MSO definable string transductions and two-way finite state transducers CoRR cs.LO/9906007: (1999)
103 Joost Engelfriet: Derivation Trees of Ground Term Rewriting Systems. Inf. Comput. 152(1): 1-15 (1999)
102 Joost Engelfriet, Sebastian Maneth: Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154(1): 34-91 (1999)
101EEJoost Engelfriet, Tjalling Gelsema: Multisets and Structural Congruence of the pi-Calculus with Replication. Theor. Comput. Sci. 211(1-2): 311-337 (1999)
1998
100 Joost Engelfriet, Sebastian Maneth: Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998: 15-29
99EEJoost Engelfriet, Tjalling Gelsema: Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. Acta Inf. 35(12): 1075-1096 (1998)
98 Frank Drewes, Joost Engelfriet: Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. 145(1): 1-50 (1998)
97 Joost Engelfriet, Heiko Vogler: The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 56(3): 332-356 (1998)
1997
96 Joost Engelfriet, Grzegorz Rozenberg: Node Replacement Graph Grammars. Handbook of Graph Grammars 1997: 1-94
95 Roderick Bloem, Joost Engelfriet: Monadic Second Order Logic and Node Relations on Graphs and Trees. Structures in Logic and Computer Science 1997: 144-161
94EEJoost Engelfriet, Jan Joris Vereijken: Context-Free Graph Grammars and Concatenation of Graphs. Acta Inf. 34(10): 773-803 (1997)
93 Hans L. Bodlaender, Joost Engelfriet: Domino Treewidth. J. Algorithms 24(1): 94-123 (1997)
92 Joost Engelfriet, Vincent van Oostrom: Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55(3): 489-503 (1997)
1996
91 Grzegorz Rozenberg, Joost Engelfriet: Elementary Net Systems. Petri Nets 1996: 12-121
90 Joost Engelfriet: Reverse Twin Shuffles. Bulletin of the EATCS 60: 144 (1996)
89 Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg: Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. 52(1): 170-184 (1996)
88 Joost Engelfriet, Vincent van Oostrom: Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. 53(3): 556-574 (1996)
87EEJoost Engelfriet: A Multiset Semantics for the pi-Calculus with Replication. Theor. Comput. Sci. 153(1&2): 65-94 (1996)
86EEJoost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg: Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996)
1995
85 Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg: Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Inform. 23(1): 1-32 (1995)
84 Bruno Courcelle, Joost Engelfriet: A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Mathematical Systems Theory 28(6): 515-552 (1995)
1994
83EEJoost Engelfriet: Graph Grammars and Tree Transducers. CAAP 1994: 15-36
82 Joost Engelfriet: Deciding the NTS Property of Context-Free Grammars. Results and Trends in Theoretical Computer Science 1994: 124-130
81 Joost Engelfriet, Jan Joris Vereijken: Concatenation of Graphs. TAGT 1994: 368-382
80EEHans L. Bodlaender, Joost Engelfriet: Domino Treewith (Extended Abstract). WG 1994: 1-13
79 Joost Engelfriet, Linda Heyker, George Leih: Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. Acta Inf. 31(4): 341-378 (1994)
78 Joost Engelfriet, Linda Heyker: Hypergraph Languages of Bounded Degree. J. Comput. Syst. Sci. 48(1): 58-89 (1994)
77 Joost Engelfriet, Heiko Vogler: The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49(2): 258-305 (1994)
1993
76EEJoost Engelfriet: A Multiset Semantics for the pi-Calculus with Replication. CONCUR 1993: 7-21
75 Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci. 46(2): 218-270 (1993)
74 Joost Engelfriet, Hendrik Jan Hoogeboom: X-Automata on omega-Words. Theor. Comput. Sci. 110(1): 1-51 (1993)
1992
73EEJoost Engelfriet: A Greibach Normal Form for Context-free Graph Grammars. ICALP 1992: 138-149
72 Joost Engelfriet, Linda Heyker: Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. Acta Inf. 29(2): 161-210 (1992)
71 Joost Engelfriet: An Elementary Proof of Double Greibach Normal Form. Inf. Process. Lett. 44(6): 291-293 (1992)
1991
70 Joost Engelfriet: Branching Processes of Petri Nets. Acta Inf. 28(6): 575-591 (1991)
69 Joost Engelfriet: Iterated Stack Automata and Complexity Classes Inf. Comput. 95(1): 21-75 (1991)
68 Joost Engelfriet, Linda Heyker: The String Generating Power of Context-Free Hypergraph Grammars. J. Comput. Syst. Sci. 43(2): 328-360 (1991)
67 Joost Engelfriet, Heiko Vogler: Modular Tree Transducers. Theor. Comput. Sci. 78(2): 267-303 (1991)
66 Joost Engelfriet, George Leih, Grzegorz Rozenberg: Nonterminal Separation in Graph Grammars. Theor. Comput. Sci. 82(1): 95-111 (1991)
65 Joost Engelfriet: A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theor. Comput. Sci. 88(1): 139-150 (1991)
1990
64 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: 12-23
63 Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Context-free Handle-rewriting Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 253-268
62 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: 311-327
61 Joost Engelfriet, Linda Heyker: The Term Generating Power of Context-Free Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 328-243
60EEJoost Engelfriet, George Leih, Grzegorz Rozenberg: Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs. REX Workshop 1990: 229-273
59 Joost Engelfriet, George Leih: Complexity of boundary graph languages. ITA 24: 267-274 (1990)
58 Joost Engelfriet, Grzegorz Rozenberg: A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars Inf. Comput. 84(2): 163-206 (1990)
57 Joost Engelfriet, George Leih, Emo Welzl: Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. 40(3): 307-345 (1990)
56 IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg: The Complexity of Regular DNLC Graph Languages. J. Comput. Syst. Sci. 40(3): 376-404 (1990)
1989
55 Joost Engelfriet: Context-Free NCE Graph Grammars. FCT 1989: 148-161
54EEJoost Engelfriet, Hendrik Jan Hoogeboom: Automata with Storage on Infinite Words. ICALP 1989: 289-303
53 Joost Engelfriet, Willem de Jong: Attribute Storage Optimization by Stacks. Acta Inf. 27(6): 567-581 (1989)
52 Joost Engelfriet: The Power to Two-Way Deterministic Checking Stack Automata Inf. Comput. 80(2): 114-120 (1989)
51 Joost Engelfriet, George Leih: Linear Graph Grammars: Power and Complexity Inf. Comput. 81(1): 88-121 (1989)
50EEJoost Engelfriet, Gilberto Filé: Passes, sweeps, and visits in attribute grammars. J. ACM 36(4): 841-869 (1989)
1988
49 Joost Engelfriet, George Leih, Grzegorz Rozenberg: Apex Graph Grammars and Attribute Grammars. Acta Inf. 25(5): 537-571 (1988)
48 Joost Engelfriet, Heiko Vogler: High Level Tree Transducers and Iterated Pushdown Tree Transducers. Acta Inf. 26(1/2): 131-192 (1988)
47 Joost Engelfriet, Hendrik Jan Hoogeboom: Prefix and Equality Languages of Rational Functions are Co-Context-Free. Inf. Process. Lett. 28(2): 77-79 (1988)
46 Joost Engelfriet, George Leih: Nonterminal Bounded NLC Graph Grammars. Theor. Comput. Sci. 59: 309-315 (1988)
1987
45 Joost Engelfriet, Heiko Vogler: Look-Ahead on Pushdowns Inf. Comput. 73(3): 245-279 (1987)
1986
44 IJsbrand Jan Aalbersberg, Joost Engelfriet, Grzegorz Rozenberg: Restricting the complexity of regular DNLC languages. Graph-Grammars and Their Application to Computer Science 1986: 147-166
43 Joost Engelfriet, George Leih, Grzegorz Rozenberg: Apex Graph Grammars. Graph-Grammars and Their Application to Computer Science 1986: 167-185
42 Joost Engelfriet: The complexity of Languages Generated by Attribute Grammars. SIAM J. Comput. 15(1): 70-86 (1986)
41 Joost Engelfriet, Heiko Vogler: Pushdown Machines for the Macro Tree Transducer. Theor. Comput. Sci. 42: 251-368 (1986)
40 Joost Engelfriet, Heiko Vogler: Corrigenda: Pushdown Machines for the Macro Tree Tranducer. Theor. Comput. Sci. 48(3): 339 (1986)
1985
39EEJoost Engelfriet, Heiko Vogler: Characterization of High Level Tree Transducers. ICALP 1985: 171-178
38 Joost Engelfriet: The non-computability of computability. Bulletin of the EATCS 26: 36-39 (1985)
37 Joost Engelfriet: Hierarchies of Hyper-AFLs. J. Comput. Syst. Sci. 30(1): 86-115 (1985)
36 Joost Engelfriet, Heiko Vogler: Macro Tree Transducers. J. Comput. Syst. Sci. 31(1): 71-146 (1985)
35 Joost Engelfriet: Determinacy - (Observation Equivalence = Trace Equivalence). Theor. Comput. Sci. 36: 21-25 (1985)
1984
34 Joost Engelfriet, Heiko Vogler: Regular Characterizations of Macro Tree Transducers. CAAP 1984: 103-118
33 Joost Engelfriet, Giora Slutzki: Extended Macro Grammars and Stack Controlled Machines. J. Comput. Syst. Sci. 29(3): 366-408 (1984)
1983
32 Joost Engelfriet: Attribute Grammars: Attribute Evaluation Methods. Method and tools for compiler construction 1983: 103-138
31 Joost Engelfriet: Iterated Pushdown Automata and Complexity Classes STOC 1983: 365-373
30 Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg: Context Free Normal Systems and ETOL Systems. J. Comput. Syst. Sci. 26(1): 34-46 (1983)
1982
29 Joost Engelfriet, Gilberto Filé: Simple Multi-Visit Attribute Grammars. J. Comput. Syst. Sci. 24(3): 283-314 (1982)
28 Joost Engelfriet, Sven Skyum: The Copying Power of One-State Tree Transducers. J. Comput. Syst. Sci. 25(3): 418-435 (1982)
27 Joost Engelfriet: Three Hierarchies of Transducers. Mathematical Systems Theory 15(2): 95-125 (1982)
1981
26EEJoost Engelfriet, Gilberto Filé: Passes, Sweeps and Visits. ICALP 1981: 193-207
25 Joost Engelfriet, Gilberto Filé: The Formal Power of One-Visit Attribute Grammars. Acta Inf. 16: 275-302 (1981)
24 Joost Engelfriet, Gilberto Filé: Passes and Paths of Attributive Grammars Information and Control 49(2): 125-169 (1981)
23 Joost Engelfriet, Grzegorz Rozenberg: A Tranlsational Theorem for the Class of EOL Languages Information and Control 50(2): 175-183 (1981)
1980
22EEJoost Engelfriet, Gilberto Filé: Formal Properties of One-Visit and Multi-Pass Attribute Grammars. ICALP 1980: 182-194
21EEJoost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen: Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980)
20EEJoost Engelfriet, Grzegorz Rozenberg: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. J. ACM 27(3): 499-518 (1980)
19 Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki: Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. 20(2): 150-202 (1980)
1979
18 Peter R. J. Asveld, Joost Engelfriet: Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. Acta Inf. 11: 259-285 (1979)
17 Joost Engelfriet, Giora Slutzki: Bounded Nesting in Macro Grammars Information and Control 42(2): 157-193 (1979)
16 Joost Engelfriet, Grzegorz Rozenberg: Equality Languages and Fixed Point Languages Information and Control 43(1): 20-49 (1979)
1978
15 Joost Engelfriet, Grzegorz Rozenberg: Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages FOCS 1978: 123-126
14 Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki: Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) STOC 1978: 66-74
13 Joost Engelfriet: On Tree Transducers for Partial Functions. Inf. Process. Lett. 7(4): 170-172 (1978)
12 Joost Engelfriet, Erik Meineche Schmidt: IO and OI. II. J. Comput. Syst. Sci. 16(1): 67-99 (1978)
1977
11EEJoost Engelfriet: Macro Grammars, Lindenmayer Systems and Other Copying Devices. ICALP 1977: 221-229
10 Peter R. J. Asveld, Joost Engelfriet: Iterated Deterministic Substitution Acta Inf. 8: 285-302 (1977)
9 Joost Engelfriet, Erik Meineche Schmidt: IO and OI. I. J. Comput. Syst. Sci. 15(3): 328-353 (1977)
8 Joost Engelfriet: Top-down Tree Transducers with Regular Look-ahead. Mathematical Systems Theory 10: 289-303 (1977)
7 Joost Engelfriet: Iterating Iterated Substitution. Theor. Comput. Sci. 5(1): 85-100 (1977)
1976
6 Joost Engelfriet, Sven Skyum: Copying Theorems. Inf. Process. Lett. 4(6): 157-161 (1976)
5 Joost Engelfriet: Surface Tree Languages and Parallel Derivation Trees. Theor. Comput. Sci. 2(1): 9-27 (1976)
1975
4 Joost Engelfriet: Bottom-up and Top-down Tree Transformations - A Comparison. Mathematical Systems Theory 9(3): 198-231 (1975)
1974
3 Joost Engelfriet: Simple Program Schemes and Formal Languages Springer 1974
1972
2 Joost Engelfriet: Translation of Simple Program Schemes. ICALP 1972: 215-223
1 Joost Engelfriet: A Note on Infinite Trees. Inf. Process. Lett. 1(6): 229-232 (1972)

Coauthor Index

1IJsbrand Jan Aalbersberg [44] [56]
2Peter R. J. Asveld [10] [18]
3Jan-Pascal Van Best [105]
4Roderick Bloem [95] [108]
5Hans L. Bodlaender [80] [93]
6Andreas Brandstädt [124] [125]
7Bruno Courcelle [63] [75] [84]
8Frank Drewes [98] [119] [120]
9Andrzej Ehrenfeucht [30] [85] [89]
10Gilberto Filé [22] [24] [25] [26] [29] [50]
11Zoltán Fülöp [113]
12Tjalling Gelsema [99] [101] [110] [121] [130]
13Tero Harju [86]
14Linda Heyker [61] [68] [72] [78] [79]
15Hendrik Jan Hoogeboom [47] [54] [74] [104] [105] [106] [107] [111] [127] [128] [131] [132] [133]
16Willem de Jong [53]
17Hoàng-Oanh Le [124] [125]
18Jan van Leeuwen [21]
19George Leih [43] [46] [49] [51] [57] [59] [60] [66] [79]
20Eric Lilin [134]
21Vadim V. Lozin [124] [125]
22Andreas Maletti [134]
23Sebastian Maneth [100] [102] [109] [112] [114] [115] [117] [118] [122] [123] [126] [135]
24Vincent van Oostrom [88] [92]
25Paulien ten Pas [85]
26Andrzej Proskurowski [86]
27Grzegorz Rozenberg [14] [15] [16] [19] [20] [23] [30] [43] [44] [49] [56] [58] [60] [63] [64] [66] [75] [85] [86] [89] [91] [96]
28Bart Samwel [133]
29Erik Meineche Schmidt [9] [12] [21]
30Helmut Seidl [135]
31Sven Skyum [6] [28]
32Giora Slutzki [14] [17] [19] [33]
33Jan Joris Vereijken [81] [94]
34Heiko Vogler [34] [36] [39] [40] [41] [45] [48] [67] [77] [97] [113]
35Emo Welzl [57]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)