13.2000, Support: Computational Ling: International PhD, Spain

LINGUIST List linguist at linguistlist.org
Mon Jul 29 15:59:06 UTC 2002

LINGUIST List:  Vol-13-2000. Mon Jul 29 2002. ISSN: 1068-4875.

Subject: 13.2000, Support: Computational Ling: International PhD, Spain

Moderators: Anthony Aristar, Wayne State U.<aristar at linguistlist.org>
            Helen Dry, Eastern Michigan U. <hdry at linguistlist.org>

Reviews (reviews at linguistlist.org):
	Simin Karimi, U. of Arizona
	Terence Langendoen, U. of Arizona

Consulting Editor:
        Andrew Carnie, U. of Arizona <carnie at linguistlist.org>

Editors (linguist at linguistlist.org):
	Karen Milligan, WSU 		Naomi Ogasawara, EMU
	James Yuells, EMU		Marie Klopfenstein, WSU
	Michael Appleby, EMU		Heather Taylor, EMU
	Ljuba Veselinova, Stockholm U.	Richard John Harvey, EMU
	Dina Kapetangianni, EMU		Renee Galvis, WSU
	Karolina Owczarzak, EMU		Anita Wang, EMU

Software: John Remmers, E. Michigan U. <remmers at emunix.emich.edu>
          Gayathri Sriram, E. Michigan U. <gayatri at linguistlist.org>
          Zhenwei Chen, E. Michigan U. <zhenwei at linguistlist.org>

Home Page:  http://linguistlist.org/

The LINGUIST List is funded by Eastern Michigan University, Wayne
State University, and donations from subscribers and publishers.

Editor for this issue: Michael Appleby <michael at linguistlist.org>


Date:  Sun, 21 Jul 2002 16:06:54 +0200
From:  Carlos Martin-Vide <cmv at correu.urv.es>
Subject:  Computational Ling: International PhD 2002-4, Spain

-------------------------------- Message 1 -------------------------------

Date:  Sun, 21 Jul 2002 16:06:54 +0200
From:  Carlos Martin-Vide <cmv at correu.urv.es>
Subject:  Computational Ling: International PhD 2002-4, Spain



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 - 				Zoltan Esik, 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 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			Victor Mitrana, Tarragona
Parallel Grammars			Henning Fernau, Callaghan
Grammar Systems				Erzsebet Csuhaj-Varju, Budapest
Ecogrammar Systems and Colonies		Alica Kelemenova, 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 & 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'

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

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

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 astor.urv.es

LINGUIST List: Vol-13-2000

More information about the Linguist mailing list