*********************************************************************
Final Call for Papers
5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011)
Tarragona, Spain, May 30 – June 3, 2011
http://grammars.grlmc.com/LATA2011/
*********************************************************************
--- Extended deadline: January 9, 2011, 23:59h (Western Europe time) ---
AIMS:
LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).
SCOPE:
Topics of either theoretical or applied interest include, but are not limited to:
- algebraic language theory
- algorithms for semi-structured data mining
- algorithms on automata and words
- automata and logic
- automata for system analysis and programme verification
- automata, concurrency and Petri nets
- cellular automata
- combinatorics on words
- computability
- computational complexity
- computational linguistics
- data and image compression
- decidability questions on words and languages
- descriptional complexity
- DNA and other models of bio-inspired computing
- document engineering
- foundations of finite state technology
- fuzzy and rough languages
- grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
- grammars and automata architectures
- grammatical inference and algorithmic learning
- graphs and graph transformation
- language varieties and semigroups
- language-based cryptography
- language-theoretic foundations of artificial intelligence and artificial life
- neural networks
- parallel and regulated rewriting
- parsing
- pattern recognition
- patterns and codes
- power series
- quantum, chemical and optical computing
- semantics
- string and combinatorial issues in computational biology and bioinformatics
- string processing algorithms
- symbolic dynamics
- term rewriting
- transducers
- trees, tree languages and tree machines
- weighted machines
STRUCTURE:
LATA 2011 will consist of:
- 3 invited talks
- 2 invited tutorials
- peer-reviewed contributions
- open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants)
INVITED SPEAKERS:
Thomas Colcombet (Paris), Green's Relations and Their Use in Automata
Bakhadyr Khoussainov (Auckland), Automaticity (tutorial)
Kevin Knight (Marina del Rey), Automata for Deciphering Natural Language
Jérome Lęroux (Bordeaux), Vector Addition System Reachability Problem: A Short Self-Contained Proof (tutorial)
Narad Rampersad (Ličge), Abstract Numeration Systems
PROGRAMME COMMITTEE:
Andrew Adamatzky (Bristol)
Cyril Allauzen (New York)
Amihood Amir (Ramat-Gan)
Franz Baader (Dresden)
Marie-Pierre Béal (Marne-la-Vallée)
Philip Bille (Lyngby)
Miklós Bóna (Gainesville)
Symeon Bozapalidis (Thessaloniki)
Vasco Brattka (Cape Town)
Maxime Crochemore (London)
James Currie (Winnipeg)
Jürgen Dassow (Magdeburg)
Cunsheng Ding (Hong Kong)
Rodney Downey (Wellington)
Manfred Droste (Leipzig)
Enrico Formenti (Nice)
Amy Glen (Perth)
Serge Haddad (Cachan)
Shunsuke Inenaga (Fukuoka, co-chair)
Jesper Jansson (Tokyo)
Jarkko Kari (Turku)
Marek Karpinski (Bonn)
Maciej Koutny (Newcastle)
Gregory Kucherov (Lille)
Markus Lohrey (Leipzig)
Benedikt Löwe (Amsterdam)
Salvador Lucas (Valencia)
Sebastian Maneth (Sydney)
Carlos Martín-Vide (Tarragona & Brussels, co-chair)
Giancarlo Mauri (Milano)
Alexander Meduna (Brno)
Kenichi Morita (Hiroshima)
Sven Naumann (Trier)
Gonzalo Navarro (Santiago, CL)
Mark-Jan Nederhof (St Andrews)
Joachim Niehren (Lille)
Joakim Nivre (Uppsala)
Kemal Oflazer (Doha)
Alexander Okhotin (Turku)
Witold Pedrycz (Edmonton)
Dominique Perrin (Marne-la-Vallée)
Giovanni Pighizzini (Milano)
Alberto Policriti (Udine)
Lech Polkowski (Warsaw)
Helmut Prodinger (Stellenbosch)
Mathieu Raffinot (Paris)
Philippe Schnoebelen (Cachan)
Ayumi Shinohara (Sendai)
Jamie Simpson (Perth)
Magnus Steinby (Turku)
James Storer (Boston)
Jens Stoye (Bielefeld)
Andrzej Tarlecki (Warsaw)
Richard Thomas (Leicester)
György Vaszil (Budapest)
Heiko Vogler (Dresden)
Pascal Weil (Bordeaux)
Damien Woods (Pasadena)
Thomas Zeugmann (Sapporo)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Shunsuke Inenaga (Fukuoka, co-chair)
Carlos Martín-Vide (Tarragona & Brussels, co-chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at:
http://www.easychair.org/conferences/?conf=lata2011
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.
A special issue of a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/
Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On-site registration fees: 580 Euro
On-site registration fees (PhD students): 480 Euro
At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings.
Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches.
PhD students will need to prove their status on site.
PAYMENT:
Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Julián Camarillo 4 C, 28037 Madrid, Spain):
IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide – LATA 2011).
Please write the participant’s name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference’s account.
On-site registration fees can be paid only in cash. A receipt for payments will be provided on site.
Besides paying the registration fees, it is required to fill in the registration form at the website of the conference.
IMPORTANT DATES:
Paper submission: January 9, 2011 (23:59h, Western Europe time)
Notification of paper acceptance or rejection: February 14, 2011
Early registration: February 28, 2011
Final version of the paper for the LNCS proceedings: February 28, 2011
Late registration: May 16, 2011
Starting of the conference: May 30, 2011
Submission to the post-conference special issue: August 30, 2011
FURTHER INFORMATION:
[log in to unmask]
POSTAL ADDRESS:
LATA 2011
Research Group on Mathematical Linguistics
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
|
