BibSLEIGH — Joost

Travelled to:

1 × China
1 × Czech Republic
1 × Finland
1 × Greece
1 × Hungary
1 × Israel
1 × Italy
1 × Japan
1 × Russia
1 × The Netherlands
2 × Austria
2 × Germany
4 × USA

Collaborated with:

∅ G.Rozenberg S.Maneth H.J.Hoogeboom G.Filé F.Drewes J.J.Vereijken L.Heyker H.Vogler H.Seidl E.Lilin A.Maletti B.Samwel B.Courcelle I.J.Aalbersberg G.Leih G.Slutzki

Talks about:

grammar (11) graph (8) tree (8) transduc (7) context (5) free (5) languag (4) generat (3) system (3) hypergraph (2)

Person: Joost Engelfriet

DBLP: Engelfriet:Joost

Contributed to:

2014

2008

2007

2003

2001

1999

1998

1997

1994

1992

1990

1989

1986

1985

1983

1981

1980

1978

1977

1972

Wrote 24 papers:

DLT-2014-EngelfrietMS #how #top-down #transducer: How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.
DLT-2008-EngelfrietLM #bottom-up #multi #transducer: Extended Multi Bottom-Up Tree Transducers (JE, EL, AM), pp. 289–300.
PODS-2007-EngelfrietHS #transducer #xml: XML transformation by tree-walking transducers with invisible pebbles (JE, HJH, BS), pp. 63–72.
DLT-2003-DrewesE #branch: Branching Grammars: A Generalization of ET0L Systems (FD, JE), pp. 266–278.
DLT-2001-EngelfrietM #string #transducer: Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.
ICALP-1999-EngelfrietH #finite #higher-order #logic #monad #transducer: Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
TAGT-1998-EngelfrietM #graph grammar: Tree Languages Generated be Context-Free Graph Grammars (JE, SM), pp. 15–29.
GG-Handbook-Vol1-EngelfrietR #graph grammar: Node Replacement Graph Grammars (JE, GR), pp. 1–94.
TAGT-1994-EngelfrietV #graph: Concatenation of Graphs (JE, JJV), pp. 368–382.
ICALP-1992-Engelfriet #graph grammar #normalisation: A Greibach Normal Form for Context-free Graph Grammars (JE), pp. 138–149.
GG-1990-CourcelleER #graph grammar: Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
GG-1990-Engelfriet #graph #higher-order #logic #monad: A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
GG-1990-EngelfrietH #generative #graph grammar #power of: The Term Generating Power of Context-Free Hypergraph Grammars (JE, LH), pp. 328–243.
GG-1990-EngelfrietR #graph grammar: Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars (JE, GR), pp. 12–23.
ICALP-1989-EngelfrietH #automaton #infinity #word: Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.
GG-1986-AalbersbergER #complexity #strict: Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.
GG-1986-EngelfrietLR #graph grammar: Apex Graph Grammars (JE, GL, GR), pp. 167–185.
ICALP-1985-EngelfrietV #transducer: Characterization of High Level Tree Transducers (JE, HV), pp. 171–178.
STOC-1983-Engelfriet #automaton #complexity: Iterated Pushdown Automata and Complexity Classes (JE), pp. 365–373.
ICALP-1981-EngelfrietF: Passes, Sweeps and Visits (JE, GF), pp. 193–207.
ICALP-1980-EngelfrietF #attribute grammar #multi: Formal Properties of One-Visit and Multi-Pass Attribute Grammars (JE, GF), pp. 182–194.
STOC-1978-EngelfrietRS #transducer: Tree Transducers, L Systems and Two-Way Machines (JE, GR, GS), pp. 66–74.
ICALP-1977-Engelfriet #metaprogramming: Macro Grammars, Lindenmayer Systems and Other Copying Devices (JE), pp. 221–229.
ICALP-1972-Engelfriet: Translation of Simple Program Schemes (JE), pp. 215–223.