Ecole: 2nd International PhD School in Formal Languages and Applications

Thierry Hamon thierry.hamon at LIPN.UNIV-PARIS13.FR
Tue Jul 23 08:59:28 UTC 2002

Date: Sun, 21 Jul 2002 16:06:54 +0200
From: Carlos Martin-Vide <cmv at>
Message-Id: < at>



Rovira i Virgili University
Research Group on Mathematical Linguistics

Tarragona, Spain

Courses and professors 1st term (March-June 2003):

Applications of Formal Languages		Solomon Marcus, Bucharest
Languages				Zoltán Ésik, Szeged
Combinatorics on Words			Tero Harju, Turku
Regular Grammars				Masami Ito, Kyoto
Context-Free Grammars			Manfred Kudlek, Hamburg
Context-Sensitive Grammars			Alexandru Mateescu, Bucharest
Mildly Context-Sensitive Grammars		Henning Bordihn, Potsdam
Derivation Trees				Carlos Martín-Vide, Tarragona
Finite Automata				Sheng Yu, London ON
Pushdown Automata			Hendrik Jan Hoogeboom, Leiden
Turing Machines				Maurice Margenstern, Metz
Patterns					Kai Salomaa, Kingston ON
Infinite Words				Juhani Karhumäki, Turku
Two-Dimensional Languages			Kenichi Morita, Hiroshima
Regulated Rewriting			Jürgen Dassow, Magdeburg
Contextual Grammars			Victor Mitrana, Tarragona
Parallel Grammars				Henning Fernau, Callaghan
Grammar Systems				Erzsébet Csuhaj-Varjú, Budapest
Ecogrammar Systems and Colonies		Alica Kelemenová, Opava

Courses and professors 2nd term (October 2003-February 2004):

Tree Automata and Tree Languages		Magnus Steinby, Turku
Formal Power Series			Werner Kuich, Vienna
DNA Computing: Theory and Experiments	Grzegorz Rozenberg, Leiden
Membrane Computing			Gheorghe Paun, Tarragona
Splicing Systems and Aqueous Computing	Tom Head, Binghamton NY
Quantum Computing			Cristian Calude, Auckland
Developmental Languages vs. DNA Computing	Arto Salomaa, Turku
Cellular Automata				Giancarlo Mauri, Milano
Formal Languages and Natural Language Syntax	Walter Savitch, San Diego CA
Parsing					Giorgio Satta, Padua
Tree Adjoining Grammars			James Rogers, Richmond IN
Weighted Finite-State Transducers		Mehryar Mohri, Florham Park NJ
Formal Languages and Logic			Vincenzo Manca, Verona
Grammatical Inference and Learning		Takashi Yokomori, Tokyo
Grammar-Theoretic Models in Artificial Life	Jozef Kelemen, Opava
Syntactic Methods in Pattern Recognition	Rudolf Freund, Vienna
Automata-Based Techniques for Verification and
Other Decision Problems			Oscar Ibarra, Santa Barbara CA
Text Searching Algorithms			Ricardo Baeza-Yates, Santiago de Chile
Cryptography				Valtteri Niemi, Helsinki
Computational Complexity			Markus Holzer, Munich
Descriptional Complexity of Automata and
Grammars				Detlef Wotschke, Frankfurt


After following the courses, students enrolled in the programme will have
to write and defend a dissertation in English in their own area of
interest, in order to get the so-called European PhD degree. All the
professors in the programme will be allowed to supervise students' theses.

Tuition fees:

780 euros each term, appr.


Candidate students for the programme are welcome from around the world.
Most appropriate degrees include: Computer Science, Mathematics and
Linguistics. Students are assumed either to have a good background in
discrete mathematics or to be ready to get it by March 2003.


According to the expected programme's budget, 7 accepted students will be
funded, so that their tuition fees, accommodation and living expenses while
in Spain will be all covered by the programme.

Pre-registration procedure:

In order to be pre-registered, one should send to the programme chairman:

-	full CV,
-	letters of recommendation (optional),
-	any other document to prove background, interest and motivation (optional).

E-mail, fax, post are all accepted.


Pre-registration: November 10, 2002
Selection of students: November 15, 2002
Application for funding: November 30, 2002
Decision about funding: February 15, 2003
Registration: March 25, 2003
Starting of the courses: March 26, 2003

Questions and further information:

Please, contact the programme chairman, Carlos Martin-Vide, at
cmv at

Message diffusé par la liste Langage Naturel <LN at>
Informations, abonnement :
English version          :
Archives                 :

La liste LN est parrainée par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhésion  :

More information about the Ln mailing list