10 August: fyi -- phd program
Index of August 2001 | Index of year: 2001 | Full index
1st INTERNATIONAL PhD SCHOOL IN FORMAL
LANGUAGES AND
APPLICATIONS
2001-2003
Rovira i Virgili University
Research Group on Mathematical Linguistics
Tarragona, Spain
Courses and professors 1st year (April-June 2002):
Applications of Formal Languages Solomon Marcus,
Bucharest Languages Victor Mitrana,
Bucharest 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
Martin-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 Karhumaki, Turku Two-Dimensional Languages
Kenichi Morita, Hiroshima Regulated Rewriting
Juergen Dassow, Magdeburg Contextual Grammars
Rodica Ceterchi, Bucharest Parallel Grammars
Henning Fernau, Tuebingen
Courses and professors 2nd year (October 2002-January 2003):
Grammar Systems Erzsebet Csuhaj-Varju,
Budapest Ecogrammar Systems and Colonies Alica
Kelemenova, Opava 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, Bucharest Splicing Systems and Aqueous
Computing
Tom Head, Binghamton Quantum Computing
Cristian Calude, Auckland Formal Languages and Natural
Language
Syntax Walter Savitch, San Diego Parsing
Giorgio Satta, Padua Tree Adjoining Grammars
James Rogers, Richmond IN Weighted Finite-State Transducers
Mehryar Mohri, AT&T, Florham Park NJ Formal Languages and
Logic
Vincenzo Manca, Pisa Grammatical Inference and
Learning Takashi Yokomori, Tokyo Grammar-Theoretic
Models
in Artificial Life Jozef Kelemen, Opava Syntactic Methods in
Pattern Recognition Rudolf Freund, Vienna Text Searching
Algorithms Ricardo Baeza-Yates, Santiago de Chile
Cryptography Valtteri Niemi, Nokia,
Vaasa Complexity Markus Holzer,
Munich
Dissertation:
After following the courses, students enrolled in the programme will
have to write 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' work.
Students:
Candidate students for the programme are welcome from around the
world. Most appropriate previous degrees of students include:
Computer
Science, Mathematics and Linguistics. Students are assumed
either to
have a certain background in discrete mathematics or to be ready
to
get it by April 2002.
According to the expected programme's budget, more than half of
the
accepted students will be funded, so that their accommodation and
living expenses while in Spain will be covered by the programme.
These
conditions could be improved, at the programme chairman's
discretion
and depending on the definite availability of resources, in the case
of students from Eastern European countries and others.
Deadlines:
Free pre-registration: September 30, 2001
Selection of students: November 15, 2001
Application for funding: December 15, 2001
Decision about funding: February 15, 2002
Registration: February 28, 2002
Starting of the courses: April 2, 2002
Questions and further information:
Please, contact the programme chairman, Carlos Martin-Vide, at
cmv@astor.urv.es
Index of August 2001 | Index of year: 2001 | Full index