Joost Engelfriet

Contact information

tel: (+31) 071-5277139
fax: (+31) 071-5276985

e-mail: engelfri(a)liacs.nl

my oldest son: Joeri Engelfriet (his company and his publications)
my youngest son: Tako Engelfriet
my granddaughter: Laura

Current projects

Research:

Member of the cluster Foundations of Software Technology

Member of the group Theoretical Computer Science

Onderwijs: Geen. Vroeger wel, nl.:

Bestandsorganisatie en databanken

Logica voor Informatici

Formele Talen en Automaten 1

Formele Talen en Automaten 2 (Attributengrammatica's)

Theorie van Concurrency 1

all publications (1972-now)

2011:

• Book submitted for publication:

  B. Courcelle, J. Engelfriet; Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach; to be published by Cambridge University Press.

  (741 pages, 9 chapters plus index, references; there will be a preface by Maurice Nivat; finished version)

2009:

• J. Engelfriet, E. Lilin, A. Maletti; Extended multi bottom-up tree transducers -- Composition and decomposition, Acta Informatica 46 (2009), 561-590 online authorcopy
• J. Engelfriet, S. Maneth, H. Seidl; Deciding equivalence of top-down XML transformations in polynomial time, J. of Comp. Syst. Sci. 75 (2009), 271-286 online
• J. Engelfriet; The time complexity of typechecking tree-walking tree transducers, Acta Informatica 46 (2009), 139-154 online authorcopy

2008:

• J. Engelfriet, E. Lilin, A. Maletti; Extended multi bottom-up tree transducers, in: DLT 2008 (M. Ito and F. M. Toyama, editors), September 2008, Kyoto, Lecture Notes in Computer Science 5257, Springer-Verlag, 2008, pp.289-300 online authorcopy
• J. Engelfriet; The time complexity of typechecking tree-walking tree transducers, Technical Report 2008-01, Leiden Institute of Advanced Computer Science, Leiden University, January 2008

2007:

• J. Engelfriet, H.J. Hoogeboom; Finitary compositions of two-way finite-state transductions, Fundamenta Informaticae 80 (2007), 111-123 authorcopy
• J. Engelfriet, H.J. Hoogeboom, B. Samwel; XML transformation by tree-walking transducers with invisible pebbles, in: 26th PODS (L. Libkin, ed.), June 2007, Beijing, ACM Press, pp.63-72 online authorcopy
• J. Engelfriet, H.J. Hoogeboom; Automata with nested pebbles capture first-order logic with transitive closure, Logical Methods in Computer Science 3 (2007), Issue 2, Paper 3 online report
• J. Engelfriet; A Kleene characterization of computability, Information Processing Letters 101 (2007), 139-140 online authorcopy
• J. Engelfriet, Tj. Gelsema; An exercise in structural congruence, Information Processing Letters 101 (2007), 1-5 online authorcopy

Quote