The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joost Engelfriet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  130. Extended Multi Bottom-Up Tree Transducers. [Citation Graph (, )][DBLP]


  131. The time complexity of typechecking tree-walking tree transducers. [Citation Graph (, )][DBLP]


  132. Extended multi bottom-up tree transducers. [Citation Graph (, )][DBLP]


  133. The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable [Citation Graph (, )][DBLP]


Search in 0.125secs, Finished in 0.134secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002