Joost Engelfriet
#154,315
Most Influential Person Now
Joost Engelfriet's AcademicInfluence.com Rankings
Joost Engelfrietcomputer-science Degrees
Computer Science
#8366
World Rank
#8795
Historical Rank
Database
#5381
World Rank
#5585
Historical Rank
Download Badge
Computer Science
Joost Engelfriet's Degrees
- PhD Computer Science University of Amsterdam
- Masters Computer Science University of Amsterdam
- Bachelors Computer Science University of Amsterdam
Similar Degrees You Can Earn
Why Is Joost Engelfriet Influential?
(Suggest an Edit or Addition)Joost Engelfriet's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach (2012) (474)
- Handle-Rewriting Hypergraph Grammars (1993) (336)
- Branching processes of Petri nets (1991) (254)
- Macro Tree Transducers (1985) (246)
- Elementary Net Systems (1996) (238)
- MSO definable string transductions and two-way finite-state transducers (1999) (188)
- Tree Transducers, L Systems, and Two-Way Machines (1980) (178)
- Bottom-up and top-down tree transformations— a comparison (1975) (178)
- Node Replacement Graph Grammars (1997) (150)
- IO and OI. I (1977) (145)
- SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES (1980) (138)
- Top-down tree transducers with regular look-ahead (1975) (128)
- Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations (1999) (120)
- IO and OI (1975) (98)
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages (1980) (93)
- A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars (2000) (85)
- The String Generating Power of Context-Free Hypergraph Grammars (1991) (77)
- Pushdown Machines for the Macro Tree Transducer (1986) (74)
- A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars (1995) (72)
- A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars (1990) (72)
- Graph Structure and Monadic Second-Order Logic: Overview (2012) (70)
- Tree-Walking Pebble Automata (1999) (68)
- Context-free graph grammars and concatenation of graphs (1997) (66)
- Attribute Grammars: Attribute Evaluation Methods (1984) (65)
- Context-Free Graph Grammars (1997) (65)
- Macro Tree Translations of Linear Size Increase are MSO Definable (2003) (64)
- Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars (1990) (63)
- A comparison of pebble tree transducers with macro tree transducers (2003) (63)
- Clique-Width for 4-Vertex Forbidden Subgraphs (2006) (62)
- Iterated pushdown automata and complexity classes (1983) (62)
- Iterated Stack Automata and Complexity Classes (1991) (57)
- Simple Multi-Visit Attribute Grammars (1982) (57)
- Determinacy - (Observation Equivalence = Trace Equivalence) (1985) (57)
- Bottom-Up and Top-Down Tree Series Transformations (2001) (49)
- Linear Graph Grammars: Power and Complexity (1989) (48)
- Boundary Graph Grammars with Dynamic Edge Relabeling (1990) (48)
- Deciding equivalence of top-down XML transformations in polynomial time (2009) (48)
- Trips on Trees (1999) (47)
- Simple Program Schemes and Formal Languages (1974) (46)
- A Multiset Semantics for the pi-Calculus with Replication (1993) (45)
- Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs (1990) (43)
- A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (1990) (43)
- Multisets and Structural Congruence of the pi-Calculus with Replication (1999) (42)
- Domino Treewidth (1997) (41)
- Graph Grammars and Tree Transducers (1994) (40)
- On Tree Transducers for Partial Functions (1978) (40)
- The Translation Power of Top-Down Tree-to-Graph Transducers (1994) (40)
- Regular Description of Context-Free Graph Languages (1996) (39)
- Modular Tree Transducers (1987) (38)
- The equivalence problem for deterministic MSO tree transducers is decidable (2005) (38)
- Decidability of the Finiteness of Ranges of Tree Transductions (1998) (37)
- Context-free Handle-rewriting Hypergraph Grammars (1990) (37)
- Three hierarchies of transducers (1981) (37)
- Context-Free NCE Graph Grammars (1989) (36)
- Surface Tree Languages and Parallel Derivation Trees (1976) (36)
- Graph Structure and Monadic Second-Order Logic: Frontmatter (2012) (34)
- Stack Machines and Classes of Nonnested Macro Languages (1980) (33)
- XML transformation by tree-walking transducers with invisible pebbles (2007) (33)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (1992) (31)
- Logical Description of Contex-Free Graph Languages (1997) (31)
- Equality Languages and Fixed Point Languages (1979) (31)
- Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures (1996) (30)
- Tree Languages Generated be Context-Free Graph Grammars (1998) (30)
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure (2007) (27)
- Output String Languages of Compositions of Deterministic Macro Tree Transducers (2002) (26)
- Tree Automata and Tree Grammars (2015) (24)
- Apex Graph Grammars (1986) (24)
- A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic (1991) (24)
- The complexity of Languages Generated by Attribute Grammars (1986) (22)
- High level tree transducers and iterated pushdown tree transducers (1988) (22)
- Hypergraph Languages of Bounded Degree (1994) (22)
- Derivation Trees of Ground Term Rewriting Systems (1999) (21)
- Complexity of boundary graph languages (1990) (21)
- A new natural structural congruence in the pi-calculus with replication (2004) (20)
- Characterization of Properties and Relations defined in Monadic Second Order Logic on the Nodes of T (1997) (20)
- A Greibach Normal Form for Context-free Graph Grammars (1992) (20)
- Extended multi bottom–up tree transducers (2009) (20)
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations (2013) (20)
- Strong Lexicalization of Tree Adjoining Grammars (2012) (19)
- Monadic Second Order Logic and Node Relations on Graphs and Trees (1997) (19)
- IO and OI. II (1978) (19)
- Composition and Decomposition of Extended Multi Bottom-Up Tree Transducers ? (2008) (19)
- Context-Free Grammars with Storage (2014) (18)
- Passes, sweeps, and visits in attribute grammars (1989) (18)
- Nonterminal Separation in Graph Grammars (1991) (17)
- Extended Multi Bottom-Up Tree Transducers Composition and Decomposition (2009) (16)
- Nested Pebbles and Transitive Closure (2006) (16)
- Look-Ahead on Pushdowns (1987) (16)
- Passes and Paths of Attributive Grammars (1981) (16)
- Extended Macro Grammars and Stack Controlled Machines (1984) (15)
- An Elementary Proof of Double Greibach Normal Form (1992) (15)
- The formal power of one-visit attribute grammars (1981) (15)
- A Note on Infinite Trees (1972) (14)
- Graph Structure and Monadic Second-Order Logic: Monadic second-order logic (2012) (13)
- Branching synchronization grammars with nested tables (2004) (13)
- Two-Way Finite State Transducers with Nested Pebbles (2002) (13)
- Copying Theorems (1976) (13)
- Passes, Sweeps and Visits (1981) (12)
- Two-way pebble transducers for partial functions and their composition (2015) (12)
- The Copying Power of One-State Tree Transducers (1978) (12)
- The Complexity of Regular DNLC Graph Languages (1990) (12)
- Clique-Width for Four-Vertex Forbidden Subgraphs (2005) (11)
- Bounded Nesting in Macro Grammars (1979) (11)
- Extended Multi Bottom-Up Tree Transducers (2008) (11)
- Equality languages, fixed point languages and representations of recursively enumerable languages (1978) (10)
- XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles (2018) (9)
- An exercise in structural congruence (2007) (9)
- The time complexity of typechecking tree-walking tree transducers (2009) (9)
- Hierarchies of Hyper-AFLs (1985) (9)
- Finitary Compositions of Two-way Finite-State Transductions (2008) (9)
- FORMALIZING THE BEHAVIOUR OF PARALLEL OBJECT-BASED SYSTEMS BY PETRI NETS (1990) (8)
- Composition Closure of Linear Extended Top-down Tree Transducers (2013) (8)
- Two-Way Finite State Transducers and Monadic Second-Order Logic (1999) (8)
- The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers (1998) (8)
- Tree transducers, L systems and two-way machines (Extended Abstract) (1978) (8)
- Formal Properties of One-Visit and Multi-Pass Attribute Grammars (1980) (7)
- Iterating Iterated Substitution (1977) (7)
- Reverse Twin Shuffles (1996) (7)
- Nonterminal Bounded NLC Graph Grammars (1988) (7)
- Apex graph grammars and attribute grammars (1988) (7)
- Graph Structure and Monadic Second-Order Logic: Algorithmic applications (2012) (7)
- Context-free graph languages of bounded degree are generated by apex graph grammars (1994) (6)
- Automata with Storage on Infinite Words (1989) (6)
- Macro Grammars, Lindenmayer Systems and Other Copying Devices (1977) (6)
- Finite Languages for the Representation of Finite Graphs (1996) (6)
- Attribute storage optimization by stacks (1990) (6)
- Structural inclusion in the pi-calculus with replication (2001) (6)
- Multiple Context-Free Tree Grammars: Lexicalization and Characterization (2017) (5)
- The Power to Two-Way Deterministic Checking Stack Automata (1989) (5)
- Net-based description of parallel object based mechanisms (1991) (5)
- Restricting the complexity of regular DNLC languages (1986) (5)
- Characterizing and Deciding MSO-Definability of Macro Tree Transductions (2000) (5)
- Characterization of High Level Tree Transducers (1985) (5)
- A Tranlsational Theorem for the Class of EOL Languages (1981) (4)
- Look-ahead removal for total deterministic top-down tree transducers (2016) (4)
- Translation of Simple Program Schemes (1972) (4)
- Deciding the NTS Property of Context-Free Grammars (1994) (4)
- Look-Ahead Removal for Top-Down Tree Transducers (2013) (4)
- Concatenation of Graphs (1994) (4)
- Iterated deterministic substitution (1977) (3)
- How to Remove the Look-Ahead of Top-Down Tree Transducers (2014) (3)
- Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars (2017) (3)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (2019) (3)
- Domino Treewith (Extended Abstract) (1994) (3)
- Pushdown machines for the macro tree transducer: theoretical computer sciences 42(3) (1986) 251-368 (1986) (3)
- Extended linear macro grammars, iteration grammars, and register programs (1979) (3)
- A Kleene characterization of computability (2007) (3)
- MSO de nable string transductions and two-way nite state transducers (2015) (3)
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage (2019) (2)
- Context Free Normal Systems and ETOL Systems (1983) (2)
- Generating strings with hypergraph grammars (1987) (2)
- The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction (1989) (2)
- Determinacy and rewriting of functional top-down and MSO tree transformations (2017) (2)
- The ETOL Hierarchy is in the oi Hierarchy (1986) (2)
- Regular Characterizations of Macro Tree Transducers (1984) (2)
- Corrigenda: Pushdown Machines for the Macro Tree Tranducer (1986) (2)
- The Delta Operation: From Strings to Trees to Strings (2002) (2)
- Grammatical Codes of Trees and Terminally Coded Grammars (1995) (2)
- Axioms for generalized graphs, illustrated by a Cantor–Bernstein proposition (1998) (2)
- The Term Generating Power of Context-Free Hypergraph Grammars (1990) (2)
- Multisets and structutal congruence of pi-calculus with replication (2004) (2)
- Branching Grammars: A Generalization of ET0L Systems (2003) (1)
- A note on non-generators of full afl's : (preprint) (1981) (1)
- Graph algebras and widths of graphs (2012) (1)
- Structural Congruence in the pi-Calculus with Potential Replication (2015) (1)
- The complexity of typechecking tree-walking tree transducers ? (2008) (1)
- The generative power of delegation networks (2015) (1)
- Hierarchies of String Languages Generated by Deterministic Tree Transducers (2001) (1)
- A Greibach Normal Form of Context - free Graph Grammars, in "Automata, Languages and Programming" (1992) (0)
- The Trees of Hanoi (2017) (0)
- Graph Structure and Monadic Second-Order Logic: References (2012) (0)
- Output String Languages of Compositions of Deterministi Ma ro Tree Transdu (2015) (0)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (2019) (0)
- List of preprints and publications (1997) (0)
- Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars (2015) (0)
- Graph Structure and Monadic Second-Order Logic: Transductions of terms and words (2012) (0)
- Erratum to: “Top-down Tree Transducers with Regular Look-ahead” (2016) (0)
- Computability by Monadic Second-Order Logic (2020) (0)
- Two-way pebble transducers for partial functions and their composition (2015) (0)
- Prefix and Equality Languages of Rational Functions are Co-Context-Free (1988) (0)
- Graph Structure and Monadic Second-Order Logic: Monadic second-order transductions (2012) (0)
- Generalized Context-Free Grammars (2010) (0)
- Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75] (2019) (0)
- The Trees of Hanoi (revised version). CoRR abs/1710.04551 (2017) (0)
- Equivalence - Combinatorics, Algebra, Proofs (2016) (0)
- Erratum to: “Top-down Tree Transducers with Regular Look-ahead” (2015) (0)
- Automation of Data-Processing in Life Insurance. (1958) (0)
- Conclusion and open problems (2012) (0)
- The non-computability of computability (1985) (0)
- Composition Closure of Linear Extended Top-down Tree Transducers (2015) (0)
- Graph Structure and Monadic Second-Order Logic: Equational and recognizable sets in many-sorted algebras (2012) (0)
- Graph Structure and Monadic Second-Order Logic: Equational and recognizable sets of graphs (2012) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Joost Engelfriet?
Joost Engelfriet is affiliated with the following schools:
