default search action
Joost Engelfriet
Person information
- affiliation: Leiden Institute of Advanced Computer Science, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j107]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica 58(1-2): 95-152 (2021) - [j106]Joost Engelfriet:
Computability by monadic second-order logic. Inf. Process. Lett. 167: 106074 (2021) - [j105]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: 40-97 (2021) - 2020
- [j104]Joost Engelfriet, Heiko Vogler:
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [i12]Joost Engelfriet:
Computability by Monadic Second-Order Logic. CoRR abs/2008.12151 (2020)
2010 – 2019
- 2019
- [j103]Joost Engelfriet:
Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]. Inf. Comput. 267: 164-167 (2019) - [i11]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. CoRR abs/1904.09203 (2019) - [i10]Joost Engelfriet, Heiko Vogler:
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. CoRR abs/1905.00559 (2019) - 2018
- [j102]Joost Engelfriet, Andreas Maletti
, Sebastian Maneth:
Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. 728: 29-99 (2018) - [i9]Joost Engelfriet, Hendrik Jan Hoogeboom
XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. CoRR abs/1809.05730 (2018) - 2017
- [j101]Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. 85: 57-73 (2017) - [j100]Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60(2): 129-171 (2017) - [c44]Joost Engelfriet, Andreas Maletti:
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT 2017: 217-229 - [i8]Joost Engelfriet, Andreas Maletti, Sebastian Maneth:
Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR abs/1707.03457 (2017) - [i7]Joost Engelfriet:
The Trees of Hanoi. CoRR abs/1710.04551 (2017) - 2016
- [j99]Joost Engelfriet:
Erratum to: "Top-down Tree Transducers with Regular Look-ahead". Theory Comput. Syst. 58(2): 377-379 (2016) - [j98]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016) - [p3]Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet:
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243 - 2015
- [j97]Joost Engelfriet:
Two-way pebble transducers for partial functions and their composition. Acta Informatica 52(7-8): 559-571 (2015) - [j96]Frank Drewes, Joost Engelfriet:
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. 22(2): 373-392 (2015) - [j95]Frank Drewes, Joost Engelfriet:
The generative power of delegation networks. Inf. Comput. 245: 213-258 (2015) - [i6]Joost Engelfriet:
Tree Automata and Tree Grammars. CoRR abs/1510.02036 (2015) - 2014
- [c43]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115 - [i5]Joost Engelfriet:
Context-Free Grammars with Storage. CoRR abs/1408.0683 (2014) - 2013
- [c42]Michael Benedikt
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. MFCS 2013: 146-158 - [i4]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013) - 2012
- [b2]Bruno Courcelle, Joost Engelfriet:
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Encyclopedia of mathematics and its applications 138, Cambridge University Press 2012, ISBN 978-0-521-89833-1, pp. I-XIV, 1-728 - [j94]Bruno Courcelle, Joost Engelfriet:
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Bull. EATCS 108: 179 (2012) - [c41]Andreas Maletti, Joost Engelfriet:
Strong Lexicalization of Tree Adjoining Grammars. ACL (1) 2012: 506-515
2000 – 2009
- 2009
- [j93]Joost Engelfriet:
The time complexity of typechecking tree-walking tree transducers. Acta Informatica 46(2): 139-154 (2009) - [j92]Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended multi bottom-up tree transducers. Acta Informatica 46(8): 561-590 (2009) - [j91]Joost 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
- [c40]Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory 2008: 289-300 - 2007
- [j90]Joost Engelfriet, Hendrik Jan Hoogeboom:
Finitary Compositions of Two-way Finite-State Transductions. Fundam. Informaticae 80(1-3): 111-123 (2007) - [j89]Joost Engelfriet, Tjalling Gelsema:
An exercise in structural congruence. Inf. Process. Lett. 101(1): 1-5 (2007) - [j88]Joost Engelfriet:
A Kleene characterization of computability. Inf. Process. Lett. 101(4): 139-140 (2007) - [j87]Joost Engelfriet, Hendrik Jan Hoogeboom
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Log. Methods Comput. Sci. 3(2) (2007) - [c39]Joost Engelfriet, Hendrik Jan Hoogeboom
XML transformation by tree-walking transducers with invisible pebbles. PODS 2007: 63-72 - [i3]Joost Engelfriet, Hendrik Jan Hoogeboom:
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. CoRR abs/cs/0703079 (2007) - 2006
- [j86]Joost Engelfriet, Sebastian Maneth:
The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5): 206-212 (2006) - [j85]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le
Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006) - [c38]Joost Engelfriet, Hendrik Jan Hoogeboom
Nested Pebbles and Transitive Closure. STACS 2006: 477-488 - 2005
- [c37]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196 - [c36]Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005: 495-504 - [i2]Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable. CoRR abs/cs/0506014 (2005) - 2004
- [j84]Joost Engelfriet, Tjalling Gelsema:
A new natural structural congruence in the pi-calculus with replication. Acta Informatica 40(6-7): 385-430 (2004) - [j83]Frank Drewes, Joost Engelfriet:
Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. 68(3): 611-656 (2004) - 2003
- [j82]Joost Engelfriet, Sebastian Maneth:
A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39(9): 613-698 (2003) - [j81]Joost Engelfriet, Sebastian Maneth:
Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32(4): 950-1006 (2003) - [c35]Frank Drewes, Joost Engelfriet:
Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory 2003: 266-278 - 2002
- [j80]Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7(1): 11-70 (2002) - [j79]Joost Engelfriet, Sebastian Maneth:
Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64(2): 350-395 (2002) - [c34]Joost Engelfriet:
The Delta Operation: From Strings to Trees to Strings. Formal and Natural Computing 2002: 39-56 - [c33]Joost Engelfriet, Sebastian Maneth:
Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002: 234-244 - 2001
- [j78]Joost Engelfriet, Tjalling Gelsema:
Structural inclusion in the pi-calculus with replication. Theor. Comput. Sci. 258(1-2): 131-168 (2001) - [j77]Joost Engelfriet, Hendrik Jan Hoogeboom
MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2): 216-254 (2001) - [c32]Joost Engelfriet, Sebastian Maneth:
Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001: 228-238 - 2000
- [j76]Roderick Bloem
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars. J. Comput. Syst. Sci. 61(1): 1-50 (2000) - [c31]Joost Engelfriet, Sebastian Maneth:
Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000: 542-554
1990 – 1999
- 1999
- [j75]Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal van Best:
Trips on Trees. Acta Cybern. 14(1): 51-64 (1999) - [j74]Joost Engelfriet:
Derivation Trees of Ground Term Rewriting Systems. Inf. Comput. 152(1): 1-15 (1999) - [j73]Joost Engelfriet, Sebastian Maneth:
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154(1): 34-91 (1999) - [j72]Joost Engelfriet, Tjalling Gelsema:
Multisets and Structural Congruence of the pi-Calculus with Replication. Theor. Comput. Sci. 211(1-2): 311-337 (1999) - [c30]Joost Engelfriet, Hendrik Jan Hoogeboom:
Tree-Walking Pebble Automata. Jewels are Forever 1999: 72-83 - [c29]Joost Engelfriet, Hendrik Jan Hoogeboom:
Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP 1999: 311-320 - [i1]Joost Engelfriet, Hendrik Jan Hoogeboom:
MSO definable string transductions and two-way finite state transducers. CoRR cs.LO/9906007 (1999) - 1998
- [j71]Joost Engelfriet, Tjalling Gelsema:
Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. Acta Informatica 35(12): 1075-1096 (1998) - [j70]Frank Drewes, Joost Engelfriet:
Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. 145(1): 1-50 (1998) - [j69]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) - [c28]Joost Engelfriet, Sebastian Maneth:
Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998: 15-29 - 1997
- [j68]Joost Engelfriet, Jan Joris Vereijken:
Context-Free Graph Grammars and Concatenation of Graphs. Acta Informatica 34(10): 773-803 (1997) - [j67]Hans L. Bodlaender, Joost Engelfriet:
Domino Treewidth. J. Algorithms 24(1): 94-123 (1997) - [j66]Joost Engelfriet, Vincent van Oostrom
Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55(3): 489-503 (1997) - [c27]Roderick Bloem, Joost Engelfriet:
Monadic Second Order Logic and Node Relations on Graphs and Trees. Structures in Logic and Computer Science 1997: 144-161 - [p2]Joost Engelfriet, Grzegorz Rozenberg:
Node Replacement Graph Grammars. Handbook of Graph Grammars 1997: 1-94 - [p1]Joost Engelfriet:
Context-Free Graph Grammars. Handbook of Formal Languages (3) 1997: 125-213 - 1996
- [j65]Joost Engelfriet:
Reverse Twin Shuffles. Bull. EATCS 60: 144 (1996) - [j64]Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg:
Finite Languages for the Representation of Finite Graphs. J. Comput. Syst. Sci. 52(1): 170-184 (1996) - [j63]Joost Engelfriet, Vincent van Oostrom
Regular Description of Context-Free Graph Languages. J. Comput. Syst. Sci. 53(3): 556-574 (1996) - [j62]Joost Engelfriet:
A Multiset Semantics for the pi-Calculus with Replication. Theor. Comput. Sci. 153(1&2): 65-94 (1996) - [j61]Joost Engelfriet, Tero Harju
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996) - [c26]Grzegorz Rozenberg, Joost Engelfriet:
Elementary Net Systems. Petri Nets 1996: 12-121 - 1995
- [j60]Andrzej Ehrenfeucht, Joost Engelfriet, Paulien ten Pas, Grzegorz Rozenberg:
Grammatical Codes of Trees and Terminally Coded Grammars. Fundam. Informaticae 23(1): 1-32 (1995) - [j59]Bruno Courcelle, Joost Engelfriet:
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28(6): 515-552 (1995) - 1994
- [j58]Joost Engelfriet, Linda Heyker, George Leih:
Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars. Acta Informatica 31(4): 341-378 (1994) - [j57]Joost Engelfriet, Linda Heyker:
Hypergraph Languages of Bounded Degree. J. Comput. Syst. Sci. 48(1): 58-89 (1994) - [j56]Joost Engelfriet, Heiko Vogler:
The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49(2): 258-305 (1994) - [c25]Joost Engelfriet:
Deciding the NTS Property of Context-Free Grammars. Results and Trends in Theoretical Computer Science 1994: 124-130 - [c24]Joost Engelfriet:
Graph Grammars and Tree Transducers. CAAP 1994: 15-36 - [c23]Joost Engelfriet, Jan Joris Vereijken:
Concatenation of Graphs. TAGT 1994: 368-382 - [c22]Hans L. Bodlaender
Domino Treewith (Extended Abstract). WG 1994: 1-13 - 1993
- [j55]Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg:
Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci. 46(2): 218-270 (1993) - [j54]Joost Engelfriet, Hendrik Jan Hoogeboom:
X-Automata on omega-Words. Theor. Comput. Sci. 110(1): 1-51 (1993) - [c21]Joost Engelfriet:
A Multiset Semantics for the pi-Calculus with Replication. CONCUR 1993: 7-21 - 1992
- [j53]Joost Engelfriet, Linda Heyker:
Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. Acta Informatica 29(2): 161-210 (1992) - [j52]Joost Engelfriet:
An Elementary Proof of Double Greibach Normal Form. Inf. Process. Lett. 44(6): 291-293 (1992) - [c20]Joost Engelfriet:
A Greibach Normal Form for Context-free Graph Grammars. ICALP 1992: 138-149 - 1991
- [j51]Joost Engelfriet:
Branching Processes of Petri Nets. Acta Informatica 28(6): 575-591 (1991) - [j50]Joost Engelfriet:
Iterated Stack Automata and Complexity Classes. Inf. Comput. 95(1): 21-75 (1991) - [j49]Joost Engelfriet, Linda Heyker:
The String Generating Power of Context-Free Hypergraph Grammars. J. Comput. Syst. Sci. 43(2): 328-360 (1991) - [j48]Joost Engelfriet, Heiko Vogler:
Modular Tree Transducers. Theor. Comput. Sci. 78(2): 267-303 (1991) - [j47]Joost Engelfriet, George Leih, Grzegorz Rozenberg:
Nonterminal Separation in Graph Grammars. Theor. Comput. Sci. 82(1): 95-111 (1991) - [j46]Joost Engelfriet:
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. Theor. Comput. Sci. 88(1): 139-150 (1991) - 1990
- [j45]Joost Engelfriet, Willem de Jong:
Attribute Storage Optimization by Stacks. Acta Informatica 27(6): 567-581 (1990) - [j44]Joost Engelfriet, Grzegorz Rozenberg:
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars. Inf. Comput. 84(2): 163-206 (1990) - [j43]Joost Engelfriet, George Leih:
Complexity of boundary graph languages. RAIRO Theor. Informatics Appl. 24: 267-274 (1990) - [j42]Joost Engelfriet, George Leih, Emo Welzl:
Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. 40(3): 307-345 (1990) - [j41]IJsbrand Jan Aalbersberg
The Complexity of Regular DNLC Graph Languages. J. Comput. Syst. Sci. 40(3): 376-404 (1990) - [c19]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 - [c18]Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg:
Context-free Handle-rewriting Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 253-268 - [c17]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 - [c16]Joost Engelfriet, Linda Heyker:
The Term Generating Power of Context-Free Hypergraph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 328-243 - [c15]Joost Engelfriet, George Leih, Grzegorz Rozenberg:
Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs. REX Workshop 1990: 229-273
1980 – 1989
- 1989
- [j40]Joost Engelfriet:
The Power to Two-Way Deterministic Checking Stack Automata. Inf. Comput. 80(2): 114-120 (1989) - [j39]Joost Engelfriet, George Leih:
Linear Graph Grammars: Power and Complexity. Inf. Comput. 81(1): 88-121 (1989) - [j38]Joost Engelfriet, Gilberto Filé:
Passes, sweeps, and visits in attribute grammars. J. ACM 36(4): 841-869 (1989) - [j37]Joost Engelfriet:
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction. SIGACT News 20(3): 57-59 (1989) - [c14]Joost Engelfriet:
Context-Free NCE Graph Grammars. FCT 1989: 148-161 - [c13]Joost Engelfriet, Hendrik Jan Hoogeboom
Automata with Storage on Infinite Words. ICALP 1989: 289-303 - 1988
- [j36]Joost Engelfriet, George Leih, Grzegorz Rozenberg:
Apex Graph Grammars and Attribute Grammars. Acta Informatica 25(5): 537-571 (1988) - [j35]Joost Engelfriet, Heiko Vogler:
High Level Tree Transducers and Iterated Pushdown Tree Transducers. Acta Informatica 26(1/2): 131-192 (1988) - [j34]Joost Engelfriet, Hendrik Jan Hoogeboom:
Prefix and Equality Languages of Rational Functions are Co-Context-Free. Inf. Process. Lett. 28(2): 77-79 (1988) - [j33]Joost Engelfriet, George Leih:
Nonterminal Bounded NLC Graph Grammars. Theor. Comput. Sci. 59: 309-315 (1988) - 1987
- [j32]Joost Engelfriet, Heiko Vogler:
Look-Ahead on Pushdowns. Inf. Comput. 73(3): 245-279 (1987) - 1986
- [j31]Joost Engelfriet:
The complexity of Languages Generated by Attribute Grammars. SIAM J. Comput. 15(1): 70-86 (1986) - [j30]Joost Engelfriet, Heiko Vogler:
Pushdown Machines for the Macro Tree Transducer. Theor. Comput. Sci. 42: 251-368 (1986) - [j29]Joost Engelfriet, Heiko Vogler:
Corrigenda: Pushdown Machines for the Macro Tree Tranducer. Theor. Comput. Sci. 48(3): 339 (1986) - [c12]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 - [c11]Joost Engelfriet, George Leih, Grzegorz Rozenberg:
Apex Graph Grammars. Graph-Grammars and Their Application to Computer Science 1986: 167-185 - 1985
- [j28]Joost Engelfriet:
The non-computability of computability. Bull. EATCS 26: 36-39 (1985) - [j27]Joost Engelfriet:
Hierarchies of Hyper-AFLs. J. Comput. Syst. Sci. 30(1): 86-115 (1985) - [j26]Joost Engelfriet, Heiko Vogler:
Macro Tree Transducers. J. Comput. Syst. Sci. 31(1): 71-146 (1985) - [j25]Joost Engelfriet:
Determinacy - (Observation Equivalence = Trace Equivalence). Theor. Comput. Sci. 36: 21-25 (1985) - [c10]Joost Engelfriet, Heiko Vogler:
Characterization of High Level Tree Transducers. ICALP 1985: 171-178 - 1984
- [j24]Joost Engelfriet, Giora Slutzki:
Extended Macro Grammars and Stack Controlled Machines. J. Comput. Syst. Sci. 29(3): 366-408 (1984) - [c9]Joost Engelfriet, Heiko Vogler:
Regular Characterizations of Macro Tree Transducers. CAAP 1984: 103-118 - 1983
- [j23]Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg:
Context Free Normal Systems and ETOL Systems. J. Comput. Syst. Sci. 26(1): 34-46 (1983) - [c8]Joost Engelfriet:
Attribute Grammars: Attribute Evaluation Methods. Method and tools for compiler construction 1983: 103-138 - [c7]Joost Engelfriet:
Iterated Pushdown Automata and Complexity Classes. STOC 1983: 365-373 - 1982
- [j22]Joost Engelfriet, Gilberto Filé:
Simple Multi-Visit Attribute Grammars. J. Comput. Syst. Sci. 24(3): 283-314 (1982) - [j21]Joost Engelfriet, Sven Skyum:
The Copying Power of One-State Tree Transducers. J. Comput. Syst. Sci. 25(3): 418-435 (1982) - [j20]Joost Engelfriet:
Three Hierarchies of Transducers. Math. Syst. Theory 15(2): 95-125 (1982) - 1981
- [j19]Joost Engelfriet, Gilberto Filé:
The Formal Power of One-Visit Attribute Grammars. Acta Informatica 16: 275-302 (1981) - [j18]Joost Engelfriet, Gilberto Filé:
Passes and Paths of Attributive Grammars. Inf. Control. 49(2): 125-169 (1981) - [j17]Joost Engelfriet, Grzegorz Rozenberg:
A Tranlsational Theorem for the Class of EOL Languages. Inf. Control. 50(2): 175-183 (1981) - [c6]Joost Engelfriet, Gilberto Filé:
Passes, Sweeps and Visits. ICALP 1981: 193-207 - 1980
- [j16]Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980) - [j15]Joost Engelfriet, Grzegorz Rozenberg:
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages. J. ACM 27(3): 499-518 (1980) - [j14]Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. 20(2): 150-202 (1980) - [c5]Joost Engelfriet, Gilberto Filé:
Formal Properties of One-Visit and Multi-Pass Attribute Grammars. ICALP 1980: 182-194
1970 – 1979
- 1979
- [j13]Peter R. J. Asveld, Joost Engelfriet:
Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. Acta Informatica 11: 259-285 (1979) - [j12]Joost Engelfriet, Giora Slutzki:
Bounded Nesting in Macro Grammars. Inf. Control. 42(2): 157-193 (1979) - [j11]Joost Engelfriet, Grzegorz Rozenberg:
Equality Languages and Fixed Point Languages. Inf. Control. 43(1): 20-49 (1979) - 1978
- [j10]Joost Engelfriet:
On Tree Transducers for Partial Functions. Inf. Process. Lett. 7(4): 170-172 (1978) - [j9]Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. II. J. Comput. Syst. Sci. 16(1): 67-99 (1978) - [c4]Joost Engelfriet, Grzegorz Rozenberg:
Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages. FOCS 1978: 123-126 - [c3]Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract). STOC 1978: 66-74 - 1977
- [j8]Peter R. J. Asveld, Joost Engelfriet:
Iterated Deterministic Substitution. Acta Informatica 8: 285-302 (1977) - [j7]Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. I. J. Comput. Syst. Sci. 15(3): 328-353 (1977) - [j6]Joost Engelfriet:
Top-down Tree Transducers with Regular Look-ahead. Math. Syst. Theory 10: 289-303 (1977) - [j5]Joost Engelfriet:
Iterating Iterated Substitution. Theor. Comput. Sci. 5(1): 85-100 (1977) - [c2]Joost Engelfriet:
Macro Grammars, Lindenmayer Systems and Other Copying Devices. ICALP 1977: 221-229 - 1976
- [j4]Joost Engelfriet, Sven Skyum:
Copying Theorems. Inf. Process. Lett. 4(6): 157-161 (1976) - [j3]Joost Engelfriet:
Surface Tree Languages and Parallel Derivation Trees. Theor. Comput. Sci. 2(1): 9-27 (1976) - 1975
- [j2]Joost Engelfriet:
Bottom-up and Top-down Tree Transformations - A Comparison. Math. Syst. Theory 9(3): 198-231 (1975) - 1974
- [b1]Joost Engelfriet:
Simple Program Schemes and Formal Languages. Lecture Notes in Computer Science 20, Springer 1974, ISBN 3-540-06953-4 - 1972
- [j1]Joost Engelfriet:
A Note on Infinite Trees. Inf. Process. Lett. 1(6): 229-232 (1972) - [c1]Joost Engelfriet:
Translation of Simple Program Schemes. ICALP 1972: 215-223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: