Joost Engelfriet

(retired)

Contact information

address:
Leiden Institute of Advanced Computer Science (LIACS)
Leiden University, P.O. Box 9512
2300 RA Leiden, The Netherlands

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

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

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

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
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

2006:

J. Engelfriet, S. Maneth; The equivalence problem for deterministic MSO tree transducers is decidable, Information Processing Letters 100 (2006), 206-212 online
A. Brandstädt, J. Engelfriet, H.-O. Le, V. V. Lozin; Clique-width for 4-vertex forbidden subgraphs, Theory of Computing Systems 39 (2006), 561-590 online
J. Engelfriet, H.J. Hoogeboom; Nested pebbles and transitive closure, in: STACS 2006 (B. Durand, W. Thomas, eds.), Lecture Notes in Computer Science 3884, Springer-Verlag, 2006, pp.477-488.

2005:

J. Engelfriet, S. Maneth; The equivalence problem for deterministic MSO tree transducers is decidable, in: FSTTCS 2005 (R. Ramanujam, S. Sen, eds), Lecture Notes in Computer Science 3821, Springer-Verlag, 2005, pp.495-504 (original version, June 2005 CoRR cs.LO/0506014)
J. Engelfriet, H.J. Hoogeboom; Automata with nested pebbles capture first-order logic with transitive closure, Technical Report 05-02, Leiden Institute of Advanced Computer Science, Leiden University, April 2005 ps-file
A. Brandstädt, J. Engelfriet, H.-O. Le, V. V. Lozin; Clique-width for four-vertex forbidden subgraphs, in: Fundamentals of Computation Theory, FCT 2005 (M. Liskiewicz, R. Reischuk, eds), Lecture Notes in Computer Science 3623, Springer-Verlag, 2005, pp.185-196.
A. Brandstädt, J. Engelfriet, H.-O. Le, V. V. Lozin; Clique-width for four-vertex forbidden subgraphs, Technical Report Universität Rostock, March 2005 ps-file

2004:

J. Engelfriet, Tj. Gelsema; The decidability of structural congruence for replication restricted pi-calculus processes, Technical Report 04-07, Leiden Institute of Advanced Computer Science, Leiden University, May 2004, revised: August 2005 ps-file
F. Drewes, J. Engelfriet; Branching synchronization grammars with nested tables, J. of Comp. Syst. Sci. 68 (2004), 611-656
J. Engelfriet, Tj. Gelsema; A new natural structural congruence in the pi-calculus with replication, Acta Informatica 40 (2004), 385-430
H.J. Hoogeboom, J. Engelfriet; Pushdown Automata, in: Formal Languages and Applications
(C. Martín-Vide, V. Mitrana, G. Paun, eds.), Studies in Fuzziness and Soft Computing 148, Springer-Verlag, Berlin, 2004, pp.117-138. pdf-file .