×
Compute Distance To:
Author ID: engelfriet.joost Recent zbMATH articles by "Engelfriet, Joost"
Published as: Engelfriet, Joost; Engelfriet, J.
Homepage: http://liacs.leidenuniv.nl/~engelfrietj/
External Links: MGP · dblp

Publications by Year

Citations contained in zbMATH Open

134 Publications have been cited 1,801 times in 875 Documents Cited by Year
Graph structure and monadic second-order logic. A language-theoretic approach. Zbl 1257.68006
Courcelle, Bruno; Engelfriet, Joost
147
2012
Handle-rewriting hypergraph grammars. Zbl 0825.68446
Courcelle, Bruno; Engelfriet, Joost; Rozenberg, Grzegorz
136
1993
Bottom-up and top-down tree transformation - a comparison. Zbl 0335.68061
Engelfriet, Joost
100
1975
Top-down tree transducers with regular look-ahead. Zbl 0369.68048
Engelfriet, Joost
62
1977
Tree transducers, L systems, and two-way machines. Zbl 0426.68075
Engelfriet, Joost; Rozenberg, Grzegorz; Slutzki, Giora
58
1980
Macro tree transducers. Zbl 0588.68039
Engelfriet, Joost; Vogler, Heiko
54
1985
Branching processes of Petri nets. Zbl 0743.68106
Engelfriet, Joost
50
1991
IO and OI. II. Zbl 0371.68020
Engelfriet, Joost; Schmidt, Erik Meineche
46
1978
IO and OI. I. Zbl 0366.68053
Engelfriet, Joost; Schmidt, Erik Meineche
40
1977
Fixed point languages, equality languages, and representation of recursively enumerable languages. Zbl 0475.68047
Engelfriet, J.; Rozenberg, G.
33
1980
MSO definable string transductions and two-way finite-state transducers. Zbl 1171.03326
Engelfriet, Joost; Hoogeboom, Hendrik Jan
33
2001
A comparison of boundary graph grammars and context-free hypergraph grammars. Zbl 0706.68067
Engelfriet, Joost; Rozenberg, Grzegorz
30
1990
Macro tree transducers, attribute grammars, and MSO definable tree translations. Zbl 1045.68585
Engelfriet, Joost; Maneth, Sebastian
29
1999
Three hierarchies of transducers. Zbl 0509.68078
Engelfriet, Joost
29
1982
Pushdown machines for the macro tree transducer. Zbl 0619.68065
Engelfriet, Joost; Vogler, Heiko
28
1986
Elementary net systems. Zbl 0926.68082
Rozenberg, Grzegorz; Engelfriet, Joost
28
1998
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
27
2006
Boundary graph grammars with dynamic edge relabeling. Zbl 0694.68049
Engelfriet, Joost; Leih, George; Welzl, Emo
26
1990
Linear graph grammars: Power and complexity. Zbl 0684.68088
Engelfriet, Joost; Leih, George
26
1989
A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Zbl 0960.68086
Bloem, Roderick; Engelfriet, Joost
25
2000
A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Zbl 0830.68098
Courcelle, B.; Engelfriet, J.
23
1995
\(X\)-automata on \(\omega\)-words. Zbl 0777.68058
Engelfriet, Joost; Hoogeboom, Hendrik Jan
22
1993
On tree transducers for partial functions. Zbl 0379.94066
Engelfriet, Joost
22
1978
Graph grammars and tree transducers. Zbl 0938.68681
Engelfriet, J.
21
1994
High level tree transducers and iterated pushdown tree transducers. Zbl 0633.68073
Engelfriet, Joost; Vogler, Heiko
20
1988
The string generating power of context-free hypergraph grammars. Zbl 0776.68075
Engelfriet, Joost; Heyker, Linda
20
1991
Macro tree translations of linear size increase are MSO definable. Zbl 1029.68090
Engelfriet, Joost; Maneth, Sebastian
19
2003
Context-free NCE graph grammars. Zbl 0756.68070
Engelfriet, Joost
18
1989
The formal power of one-visit attribute grammars. Zbl 0471.68044
Engelfriet, Joost; File, Gilberto
17
1981
Iterated stack automata and complexity classes. Zbl 0758.68029
Engelfriet, Joost
17
1991
Apex graph grammars and attribute grammars. Zbl 0659.68096
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
16
1988
A characterization of context-free NCE graph languages by monadic second- order logic on trees. Zbl 0765.68090
Engelfriet, Joost
16
1991
Tree-walking pebble automata. Zbl 0944.68108
Engelfriet, Joost; Hoogeboom, Hendrik Jan
15
1999
Determinacy \(\to\) (observation equivalence \(=\) trace equivalence). Zbl 0571.68018
Engelfriet, Joost
15
1985
Graph grammars based on node rewriting: An introduction to NLC graph grammars. Zbl 0765.68091
Engelfriet, Joost; Rozenberg, Grzegorz
15
1991
Stack machines and classes of nonnested macro languages. Zbl 0428.68087
Engelfriet, Joost; Schmidt, Erik Meineche; van Leeuwen, Jan
14
1980
Context-free graph grammars and concatenation of graphs. Zbl 0896.68092
Engelfriet, Joost; Vereijken, Jan Joris
14
1997
Equality languages and fixed point languages. Zbl 0422.68034
Engelfriet, Joost; Rozenberg, Grzegorz
13
1979
Logical description of context-free graph languages. Zbl 0897.68061
Engelfriet, Joost; van Oostrom, Vincent
13
1997
Simple program schemes and formal languages. Zbl 0288.68030
Engelfriet, Joost
13
1974
A comparison of pebble tree transducers with macro tree transducers. Zbl 1060.68062
Engelfriet, Joost; Maneth, Sebastian
13
2003
Context-free hypergraph grammars have the same term-generating power as attribute grammars. Zbl 0769.68072
Engelfriet, Joost; Heyker, Linda
13
1992
A multiset semantics for the pi-calculus with replication. Zbl 0872.68125
Engelfriet, Joost
12
1996
Multisets and structural congruence of the pi-calculus with replication. Zbl 0912.68125
Engelfriet, Joost; Gelsema, Tjalling
12
1999
Context-free handle-rewriting hypergraph grammars. Zbl 0765.68084
Courcelle, Bruno; Engelfriet, Joost; Rozenberg, Grzegorz
12
1991
Copying theorems. Zbl 0323.68051
Engelfriet, Joost; Skyum, Sven
12
1976
A new natural structural congruence in the pi-calculus with replication. Zbl 1057.03022
Engelfriet, Joost; Gelsema, Tjalling
11
2004
The equivalence problem for deterministic MSO tree transducers is decidable. Zbl 1185.68385
Engelfriet, Joost; Maneth, Sebastian
11
2006
Complexity of boundary graph languages. Zbl 0701.68062
Engelfriet, Joost; Leih, George
11
1990
Context-free graph languages of bounded degree are generated by apex graph grammars. Zbl 0818.68102
Engelfriet, Joost; Heyker, Linda; Leih, George
10
1994
Trips on trees. Zbl 0926.68078
Engelfriet, Joost; Hoogeboom, Hendrik Jan; Van Best, Jan-Pascal
10
1999
Bottom-up and top-down tree series transformations. Zbl 1019.68056
Engelfriet, Joost; Fülöp, Zoltán; Vogler, Heiko
10
2002
Hypergraph languages of bounded degree. Zbl 0802.68073
Engelfriet, Joost; Heyker, Linda
9
1994
The translation power of top-down tree-to-graph transducers. Zbl 0821.68078
Engelfriet, Joost; Vogler, Heiko
9
1994
Characterization and complexity of uniformly nonprimitive labeled 2-structures. Zbl 0873.68161
Engelfriet, J.; Harju, T.; Proskurowski, A.; Rozenberg, G.
9
1996
Domino treewidth. Zbl 0882.68106
Bodlaender, Hans L.; Engelfriet, Joost
9
1997
Look-ahead on pushdowns. Zbl 0625.68063
Engelfriet, Joost; Vogler, Heiko
9
1987
Derivation trees of ground term rewriting systems. Zbl 1045.68580
Engelfriet, Joost
9
1999
Extended macro grammars and stack controlled machines. Zbl 0575.68081
Engelfriet, Joost; Slutzki, Giora
9
1984
Surface tree languages and parallel derivation trees. Zbl 0346.68040
Engelfriet, Joost
9
1976
Decidability of the finiteness of ranges of tree transductions. Zbl 1034.68525
Drewes, Frank; Engelfriet, Joost
9
1998
Nonterminal separation in graph grammars. Zbl 0727.68059
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
9
1991
Simple multi-visit attribute grammars. Zbl 0524.68048
Engelfriet, Joost; File, Gilberto
9
1982
Bounded nesting in macro grammars. Zbl 0453.68051
Engelfriet, Joost; Slutzki, Giora
8
1979
The complexity of languages generated by attribute grammars. Zbl 0589.68055
Engelfriet, Joost
8
1986
Two-way automata and checking automata. Zbl 0423.68035
Engelfriet, J.
7
1979
Monadic second order logic and node relations on graphs and trees. Zbl 0888.03025
Bloem, Roderick; Engelfriet, Joost
7
1997
Apex graph grammars. Zbl 0643.68112
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
7
1987
Deciding equivalence of top-down XML transformations in polynomial time. Zbl 1167.68032
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
7
2009
Automata with nested pebbles capture first-order logic with transitive closure. Zbl 1128.03027
Engelfriet, Joost; Hoogeboom, Hendrik Jan
7
2007
Tree transducers and syntax-directed semantics. Zbl 0539.68075
Engelfriet, Joost
7
1982
Extended multi bottom-up tree transducers. Zbl 1186.68254
Engelfriet, Joost; Lilin, Eric; Maletti, Andreas
6
2009
Nonterminal bounded NLC graph grammars. Zbl 0662.68074
Engelfriet, Joost; Leih, George
6
1988
A regular characterization of graph languages definable in monadic second-order logic. Zbl 0739.68052
Engelfriet, Joost
6
1991
An elementary proof of double Greibach normal form. Zbl 0796.68133
Engelfriet, Joost
6
1992
The complexity of regular DNLC graph languages. Zbl 0694.68045
Aalbersberg, Ijsbrand Jan; Engelfriet, Joost; Rozenberg, Grzegorz
6
1990
Tree languages generated by context-free graph grammars. Zbl 0956.68074
Engelfriet, Joost; Maneth, Sebastian
5
2000
Iterated deterministic-substitution. Zbl 0343.68034
Asveld, Peter R. J.; Engelfriet, Joost
5
1977
Passes, sweeps, and visits in attribute grammars. Zbl 0697.68069
Engelfriet, Joost; Filé, Gilberto
5
1989
Modular tree transducers. Zbl 0729.68018
Engelfriet, Joost; Vogler, Heiko
5
1991
Extended linear macro grammars, iteration grammars, and register programs. Zbl 0382.68061
Asveld, Peter R. J.; Engelfriet, Joost
4
1979
Passes and paths of attribute grammars. Zbl 0471.68045
Engelfriet, Joost; File, Gilberto
4
1981
A note on infinite trees. Zbl 0251.68041
Engelfriet, Joost
4
1972
The equivalence of bottom-up and top-down tree-to-graph transducers. Zbl 1034.68526
Engelfriet, Joost; Vogler, Heiko
4
1998
Determinacy and rewriting of top-down and MSO tree transformations. Zbl 1398.68104
Benedikt, Michael; Engelfriet, Joost; Maneth, Sebastian
4
2013
Tree transducers, \(L\) systems and two-way machines (extended abstract). Zbl 1282.68154
Engelfriet, J.; Rozenberg, G.; Slutzki, G.
4
1978
Output string languages of compositions of deterministic macro tree transducers. Zbl 1013.68124
Engelfriet, Joost; Maneth, Sebastian
4
2002
Macro grammars, Lindenmayer systems and other copying devices. Zbl 0363.68093
Engelfriet, Joost
3
1977
A hierarchy of tree transducers. Zbl 0386.68070
Engelfriet, Joost
3
1978
Regular description of context-free graph languages. Zbl 0869.68063
Engelfriet, Joost; van Oostrom, Vincent
3
1996
Pushdown automata. Zbl 1088.68089
Hoogeboom, Hendrik Jan; Engelfriet, Joost
3
2004
Hierarchies of hyper-AFLs. Zbl 0565.68072
Engelfriet, Joost
3
1985
The time complexity of typechecking tree-walking tree transducers. Zbl 1165.68039
Engelfriet, Joost
3
2009
The copying power of one-state tree transducers. Zbl 0495.68073
Engelfriet, Joost; Skyum, Sven
3
1982
A translational theorem for the class of EOL languages. Zbl 0507.68052
Engelfriet, Joost; Rozenberg, Grzegorz
3
1981
A Greibach normal form for context-free graph grammars. Zbl 1425.68162
Engelfriet, Joost
3
1992
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Zbl 1464.68165
Engelfriet, Joost; Hoogeboom, Hendrik Jan; Samwel, Bart
3
2021
Extended multi bottom-up tree transducers. Zbl 1161.68523
Engelfriet, Joost; Lilin, Eric; Maletti, Andreas
2
2008
Characterizing and deciding MSO-definability of macro tree transductions. Zbl 0962.68092
Engelfriet, Joost; Maneth, Sebastian
2
2000
Iterating iterated substitution. Zbl 0364.68070
Engelfriet, Joost
2
1978
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Zbl 1464.68165
Engelfriet, Joost; Hoogeboom, Hendrik Jan; Samwel, Bart
3
2021
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Zbl 1477.68151
Engelfriet, Joost; Vogler, Heiko
1
2020
Composition closure of linear extended top-down tree transducers. Zbl 1369.68252
Engelfriet, Joost; Fülöp, Zoltán; Maletti, Andreas
2
2017
Multiple context-free tree grammars and multi-component tree adjoining grammars. Zbl 06810956
Engelfriet, Joost; Maletti, Andreas
1
2017
Look-ahead removal for total deterministic top-down tree transducers. Zbl 1333.68163
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
2
2016
Erratum to: “Top-down tree transducers with regular look-ahead”. Zbl 1435.68157
Engelfriet, Joost
1
2016
How to remove the look-ahead of top-down tree transducers. Zbl 1298.68132
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
1
2014
Determinacy and rewriting of top-down and MSO tree transformations. Zbl 1398.68104
Benedikt, Michael; Engelfriet, Joost; Maneth, Sebastian
4
2013
Graph structure and monadic second-order logic. A language-theoretic approach. Zbl 1257.68006
Courcelle, Bruno; Engelfriet, Joost
147
2012
Deciding equivalence of top-down XML transformations in polynomial time. Zbl 1167.68032
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
7
2009
Extended multi bottom-up tree transducers. Zbl 1186.68254
Engelfriet, Joost; Lilin, Eric; Maletti, Andreas
6
2009
The time complexity of typechecking tree-walking tree transducers. Zbl 1165.68039
Engelfriet, Joost
3
2009
Extended multi bottom-up tree transducers. Zbl 1161.68523
Engelfriet, Joost; Lilin, Eric; Maletti, Andreas
2
2008
Automata with nested pebbles capture first-order logic with transitive closure. Zbl 1128.03027
Engelfriet, Joost; Hoogeboom, Hendrik Jan
7
2007
An exercise in structural congruence. Zbl 1185.68443
Engelfriet, Joost; Gelsema, Tjalling
2
2007
A Kleene characterization of computability. Zbl 1185.68330
Engelfriet, Joost
2
2007
Finitary compositions of two-way finite-state transductions. Zbl 1137.68422
Engelfriet, Joost; Hoogeboom, Hendrik Jan
1
2007
Finitary compositions of two-way finite-state transductions. Zbl 1128.68046
Engelfriet, Joost; Hoogeboom, Hendrik Jan
1
2007
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
27
2006
The equivalence problem for deterministic MSO tree transducers is decidable. Zbl 1185.68385
Engelfriet, Joost; Maneth, Sebastian
11
2006
Nested pebbles and transitive closure. Zbl 1136.68417
Engelfriet, Joost; Hoogeboom, Hendrik Jan
2
2006
The equivalence problem for deterministic MSO tree transducers is decidable. Zbl 1172.03308
Engelfriet, Joost; Maneth, Sebastian
2
2005
Clique-width for four-vertex forbidden subgraphs. Zbl 1123.68086
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoàng-Oanh; Lozin, Vadim V.
1
2005
A new natural structural congruence in the pi-calculus with replication. Zbl 1057.03022
Engelfriet, Joost; Gelsema, Tjalling
11
2004
Pushdown automata. Zbl 1088.68089
Hoogeboom, Hendrik Jan; Engelfriet, Joost
3
2004
Branching synchronization grammars with nested tables. Zbl 1069.68060
Drewes, Frank; Engelfriet, Joost
2
2004
Macro tree translations of linear size increase are MSO definable. Zbl 1029.68090
Engelfriet, Joost; Maneth, Sebastian
19
2003
A comparison of pebble tree transducers with macro tree transducers. Zbl 1060.68062
Engelfriet, Joost; Maneth, Sebastian
13
2003
Branching grammars: A generalization of ET0L systems. Zbl 1037.68068
Drewes, Frank; Engelfriet, Joost
1
2003
Bottom-up and top-down tree series transformations. Zbl 1019.68056
Engelfriet, Joost; Fülöp, Zoltán; Vogler, Heiko
10
2002
Output string languages of compositions of deterministic macro tree transducers. Zbl 1013.68124
Engelfriet, Joost; Maneth, Sebastian
4
2002
Hierarchies of string languages generated by deterministic tree transducers. Zbl 1073.68667
Engelfriet, Joost; Maneth, Sebastian
1
2002
Two-way finite state transducers with nested pebbles. Zbl 1014.68087
Engelfriet, Joost; Maneth, Sebastian
1
2002
MSO definable string transductions and two-way finite-state transducers. Zbl 1171.03326
Engelfriet, Joost; Hoogeboom, Hendrik Jan
33
2001
Structural inclusion in the pi-calculus with replication. Zbl 0974.68133
Engelfriet, J.; Gelsema, T.
1
2001
A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Zbl 0960.68086
Bloem, Roderick; Engelfriet, Joost
25
2000
Tree languages generated by context-free graph grammars. Zbl 0956.68074
Engelfriet, Joost; Maneth, Sebastian
5
2000
Characterizing and deciding MSO-definability of macro tree transductions. Zbl 0962.68092
Engelfriet, Joost; Maneth, Sebastian
2
2000
Macro tree transducers, attribute grammars, and MSO definable tree translations. Zbl 1045.68585
Engelfriet, Joost; Maneth, Sebastian
29
1999
Tree-walking pebble automata. Zbl 0944.68108
Engelfriet, Joost; Hoogeboom, Hendrik Jan
15
1999
Multisets and structural congruence of the pi-calculus with replication. Zbl 0912.68125
Engelfriet, Joost; Gelsema, Tjalling
12
1999
Trips on trees. Zbl 0926.68078
Engelfriet, Joost; Hoogeboom, Hendrik Jan; Van Best, Jan-Pascal
10
1999
Derivation trees of ground term rewriting systems. Zbl 1045.68580
Engelfriet, Joost
9
1999
Elementary net systems. Zbl 0926.68082
Rozenberg, Grzegorz; Engelfriet, Joost
28
1998
Decidability of the finiteness of ranges of tree transductions. Zbl 1034.68525
Drewes, Frank; Engelfriet, Joost
9
1998
The equivalence of bottom-up and top-down tree-to-graph transducers. Zbl 1034.68526
Engelfriet, Joost; Vogler, Heiko
4
1998
Monotonicity and persistence in preferential logics. Zbl 0894.68135
Engelfriet, J.
1
1998
Axioms for generalized graphs, illustrated by a Cantor-Bernstein proposition. Zbl 0927.68068
Engelfriet, Joost; Gelsema, Tjalling
1
1998
Context-free graph grammars and concatenation of graphs. Zbl 0896.68092
Engelfriet, Joost; Vereijken, Jan Joris
14
1997
Logical description of context-free graph languages. Zbl 0897.68061
Engelfriet, Joost; van Oostrom, Vincent
13
1997
Domino treewidth. Zbl 0882.68106
Bodlaender, Hans L.; Engelfriet, Joost
9
1997
Monadic second order logic and node relations on graphs and trees. Zbl 0888.03025
Bloem, Roderick; Engelfriet, Joost
7
1997
A multiset semantics for the pi-calculus with replication. Zbl 0872.68125
Engelfriet, Joost
12
1996
Characterization and complexity of uniformly nonprimitive labeled 2-structures. Zbl 0873.68161
Engelfriet, J.; Harju, T.; Proskurowski, A.; Rozenberg, G.
9
1996
Regular description of context-free graph languages. Zbl 0869.68063
Engelfriet, Joost; van Oostrom, Vincent
3
1996
Finite languages for the representation of finite graphs. Zbl 0846.68080
Ehrenfeucht, Andrzej; Engelfriet, Joost; Rozenberg, Grzegorz
1
1996
Reverse twin shuffles. Zbl 0875.68588
Engelfriet, Joost
1
1996
A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Zbl 0830.68098
Courcelle, B.; Engelfriet, J.
23
1995
Grammatical codes of trees and terminally coded grammars. Zbl 0827.68068
Ehrenfeucht, Andrzej; Engelfriet, Joost; ten Pas, Paulien; Rozenberg, Grzegorz
1
1995
Graph grammars and tree transducers. Zbl 0938.68681
Engelfriet, J.
21
1994
Context-free graph languages of bounded degree are generated by apex graph grammars. Zbl 0818.68102
Engelfriet, Joost; Heyker, Linda; Leih, George
10
1994
Hypergraph languages of bounded degree. Zbl 0802.68073
Engelfriet, Joost; Heyker, Linda
9
1994
The translation power of top-down tree-to-graph transducers. Zbl 0821.68078
Engelfriet, Joost; Vogler, Heiko
9
1994
Handle-rewriting hypergraph grammars. Zbl 0825.68446
Courcelle, Bruno; Engelfriet, Joost; Rozenberg, Grzegorz
136
1993
\(X\)-automata on \(\omega\)-words. Zbl 0777.68058
Engelfriet, Joost; Hoogeboom, Hendrik Jan
22
1993
Context-free hypergraph grammars have the same term-generating power as attribute grammars. Zbl 0769.68072
Engelfriet, Joost; Heyker, Linda
13
1992
An elementary proof of double Greibach normal form. Zbl 0796.68133
Engelfriet, Joost
6
1992
A Greibach normal form for context-free graph grammars. Zbl 1425.68162
Engelfriet, Joost
3
1992
Branching processes of Petri nets. Zbl 0743.68106
Engelfriet, Joost
50
1991
The string generating power of context-free hypergraph grammars. Zbl 0776.68075
Engelfriet, Joost; Heyker, Linda
20
1991
Iterated stack automata and complexity classes. Zbl 0758.68029
Engelfriet, Joost
17
1991
A characterization of context-free NCE graph languages by monadic second- order logic on trees. Zbl 0765.68090
Engelfriet, Joost
16
1991
Graph grammars based on node rewriting: An introduction to NLC graph grammars. Zbl 0765.68091
Engelfriet, Joost; Rozenberg, Grzegorz
15
1991
Context-free handle-rewriting hypergraph grammars. Zbl 0765.68084
Courcelle, Bruno; Engelfriet, Joost; Rozenberg, Grzegorz
12
1991
Nonterminal separation in graph grammars. Zbl 0727.68059
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
9
1991
A regular characterization of graph languages definable in monadic second-order logic. Zbl 0739.68052
Engelfriet, Joost
6
1991
Modular tree transducers. Zbl 0729.68018
Engelfriet, Joost; Vogler, Heiko
5
1991
The term generating power of context-free hypergraph grammars. Zbl 0765.68092
Engelfriet, Joost; Heyker, Linda
1
1991
A comparison of boundary graph grammars and context-free hypergraph grammars. Zbl 0706.68067
Engelfriet, Joost; Rozenberg, Grzegorz
30
1990
Boundary graph grammars with dynamic edge relabeling. Zbl 0694.68049
Engelfriet, Joost; Leih, George; Welzl, Emo
26
1990
Complexity of boundary graph languages. Zbl 0701.68062
Engelfriet, Joost; Leih, George
11
1990
The complexity of regular DNLC graph languages. Zbl 0694.68045
Aalbersberg, Ijsbrand Jan; Engelfriet, Joost; Rozenberg, Grzegorz
6
1990
Attribute storage optimization by stacks. Zbl 0674.68046
Engelfriet, Joost; de Jong, Willem
1
1990
Linear graph grammars: Power and complexity. Zbl 0684.68088
Engelfriet, Joost; Leih, George
26
1989
Context-free NCE graph grammars. Zbl 0756.68070
Engelfriet, Joost
18
1989
Passes, sweeps, and visits in attribute grammars. Zbl 0697.68069
Engelfriet, Joost; Filé, Gilberto
5
1989
The power of two-way deterministic checking stack automata. Zbl 0744.68042
Engelfriet, Joost
1
1989
Automata with storage on infinite words. Zbl 0697.68068
Engelfriet, Joost; Hoogeboom, Hendrik Jan
1
1989
High level tree transducers and iterated pushdown tree transducers. Zbl 0633.68073
Engelfriet, Joost; Vogler, Heiko
20
1988
Apex graph grammars and attribute grammars. Zbl 0659.68096
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
16
1988
Nonterminal bounded NLC graph grammars. Zbl 0662.68074
Engelfriet, Joost; Leih, George
6
1988
Look-ahead on pushdowns. Zbl 0625.68063
Engelfriet, Joost; Vogler, Heiko
9
1987
Apex graph grammars. Zbl 0643.68112
Engelfriet, Joost; Leih, George; Rozenberg, Grzegorz
7
1987
Generating strings with hypergraph grammars. Zbl 0638.68079
Engelfriet, Joost
1
1987
Restricting the complexity of regular DNLC languages. Zbl 0643.68111
Aalbersberg, Ijsbrand Jan; Engelfriet, Joost; Rozenberg, Grzegorz
1
1987
Pushdown machines for the macro tree transducer. Zbl 0619.68065
Engelfriet, Joost; Vogler, Heiko
28
1986
The complexity of languages generated by attribute grammars. Zbl 0589.68055
Engelfriet, Joost
8
1986
The ETOL hierarchy is in the OI-hierarchy. Zbl 0586.68069
Engelfriet, Joost
1
1986
Macro tree transducers. Zbl 0588.68039
Engelfriet, Joost; Vogler, Heiko
54
1985
Determinacy \(\to\) (observation equivalence \(=\) trace equivalence). Zbl 0571.68018
Engelfriet, Joost
15
1985
...and 34 more Documents
all top 5

Cited by 999 Authors

69 Engelfriet, Joost
40 Courcelle, Bruno
30 Fülöp, Zoltán
29 Vogler, Heiko
20 Rozenberg, Grzegorz
19 Maneth, Sebastian
19 Vágvölgyi, Sándor
16 Lozin, Vadim Vladislavovich
15 Maletti, Andreas
14 Finkel, Olivier
14 Paulusma, Daniël
13 Drewes, Frank
11 Kleijn, Jetty
11 Koutny, Maciej
11 Makowsky, Johann-Andreas
10 Bozapalidis, Symeon
10 Brandstädt, Andreas
10 Karhumaki, Juhani
9 Dabrowski, Konrad Kazimierz
9 Heggernes, Pinar
9 Meister, Daniel
8 Filiot, Emmanuel
8 Kim, Changwook
8 Reynier, Pierre-Alain
8 Rotics, Udi
8 Salomaa, Kai T.
8 Seidl, Helmut
7 Ehrenfeucht, Andrzej
7 Golovach, Petr A.
7 Gurski, Frank
7 Wanke, Egon
7 Zamaraev, Victor A.
6 Asveld, Peter R. J.
6 Ésik, Zoltán
6 Fomin, Fedor V.
6 Haar, Stefan
6 Hoàng, Chính T.
6 Kanté, Mamadou Moustapha
6 Krishna, Shankara Narayanan
6 Leih, George
6 Lohrey, Markus
6 Muscholl, Anca
6 Neven, Frank
6 Păun, Gheorghe
6 Pilipczuk, Michał
6 Skodinis, Konstantin
6 Slutzki, Giora
6 van Glabbeek, Robert Jan
5 Arnold, André
5 Bodlaender, Hans L.
5 Dauchet, Max
5 Ganian, Robert
5 Gastin, Paul
5 Harju, Tero
5 Hellmuth, Marc
5 Hoogeboom, Hendrik Jan
5 Janicki, Ryszard
5 Kalampakas, Antonios
5 Khomenko, Victor
5 Kwon, Ojoung
5 Latteux, Michel
5 Papadopoulos, Charis
5 Paul, Christophe
5 Puppis, Gabriele
5 Rahonis, George
5 Rao, Michaël
5 Szeider, Stefan
4 Aceto, Luca
4 Bojańczyk, Mikołaj
4 Brandenburg, Franz-Josef
4 Brignall, Robert
4 Eppstein, David Arthur
4 Gorrieri, Roberto
4 Heyker, Linda
4 Hliněný, Petr
4 König, Barbara
4 Korpelainen, Nicholas
4 Kratsch, Dieter
4 Kühnemann, Armin
4 Maffray, Frédéric
4 Milanič, Martin
4 Mosca, Raffaele
4 Okhotin, Alexander
4 Pinna, G. Michele
4 Schwentick, Thomas
4 Sénizergues, Géraud
4 Souza, Uéverton S.
4 Stadler, Peter F.
4 Telle, Jan Arne
4 ten Pas, Paulien
4 Todinca, Ioan
4 Vanherpe, Jean-Marie
4 Vogler, Walter
3 Alur, Rajeev
3 Baldan, Paolo
3 Bauderon, Michel
3 Bernardinello, Luca
3 Bloom, Stephen L.
3 Blumensath, Achim
3 Boiret, Adrien
...and 899 more Authors
all top 5

Cited in 86 Serials

203 Theoretical Computer Science
59 Journal of Computer and System Sciences
58 Discrete Applied Mathematics
56 Information and Computation
37 Acta Informatica
33 Information Processing Letters
25 International Journal of Foundations of Computer Science
17 Mathematical Systems Theory
16 Theory of Computing Systems
15 Algorithmica
11 Logical Methods in Computer Science
10 European Journal of Combinatorics
9 Discrete Mathematics
9 International Journal of Computer Mathematics
8 SIAM Journal on Discrete Mathematics
8 RAIRO. Theoretical Informatics and Applications
7 MSCS. Mathematical Structures in Computer Science
7 Journal of Logical and Algebraic Methods in Programming
6 Journal of Combinatorial Theory. Series B
6 RAIRO. Informatique Théorique et Applications
5 Information Sciences
5 RAIRO, Informatique Théorique
5 Annals of Pure and Applied Logic
5 Journal of Logic, Language and Information
5 ACM Transactions on Computational Logic
5 RAIRO. Theoretical Informatics and Applications
4 Artificial Intelligence
4 Formal Aspects of Computing
4 The Journal of Logic and Algebraic Programming
3 SIAM Journal on Computing
3 Discrete Event Dynamic Systems
3 Higher-Order and Symbolic Computation
3 Fundamenta Informaticae
3 Journal of Applied Logic
3 Computer Science Review
2 Kybernetes
2 Programming and Computer Software
2 Semigroup Forum
2 Graphs and Combinatorics
2 Annals of Operations Research
2 Archive for Mathematical Logic
2 Formal Methods in System Design
2 The Electronic Journal of Combinatorics
2 The Bulletin of Symbolic Logic
2 Annals of Mathematics and Artificial Intelligence
2 Journal of Graph Algorithms and Applications
2 Natural Computing
1 International Journal of Theoretical Physics
1 Journal of Mathematical Analysis and Applications
1 Journal of Mathematical Biology
1 Algebra Universalis
1 Automatica
1 BIT
1 Fuzzy Sets and Systems
1 International Journal of Computer & Information Sciences
1 Journal of Algebra
1 Journal of Combinatorial Theory. Series A
1 Journal of Graph Theory
1 The Journal of Symbolic Logic
1 Kybernetika
1 Networks
1 Cybernetics
1 Advances in Applied Mathematics
1 Science of Computer Programming
1 Operations Research Letters
1 Order
1 Journal of Automated Reasoning
1 International Journal of Algebra and Computation
1 Linear Algebra and its Applications
1 Distributed Computing
1 The Australasian Journal of Combinatorics
1 Mathematical Logic Quarterly (MLQ)
1 Journal of Functional Programming
1 International Transactions in Operational Research
1 Mathematical Problems in Engineering
1 Soft Computing
1 Journal of Combinatorial Optimization
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Discrete Dynamics in Nature and Society
1 Journal of Applied Mathematics
1 Computer Languages, Systems & Structures
1 4OR
1 Discrete Optimization
1 Optimization Letters
1 Algorithms

Citations by Year