<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"><title>LATA 2019: 1st call for papers</title></head><body>*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*<br>
<br>
*************************************************************************<br><strong>13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS</strong><br>
<br><strong>LATA 2019</strong><br>
<br><strong>Saint Petersburg, Russia</strong><br>
<br><strong>March 25-29, 2019</strong><br>
<br>
Organized by:<br>
<br>
Saint Petersburg State University<br>
and<br>
Institute for Research Development, Training and Advice, Brussels/London<br>
<br>
http://lata2019.irdta.eu/<br>
*************************************************************************<br>
<br><strong>AIMS:</strong><br>
<br>
LATA is a conference series on theoretical computer science and its applications. LATA 2019 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas.<br>
<br><strong>VENUE:</strong><br>
<br>
LATA 2019 will take place in Saint Petersburg, whose historic centre is a UNESCO World Heritage Site. The venue will be Saint Petersburg State University.<br>
<br><strong>SCOPE:</strong><br>
<br>
Topics of either theoretical or applied interest include, but are not limited to:<br>
<br>
algebraic language theory<br>
algorithms for semi-structured data mining<br>
algorithms on automata and words<br>
automata and logic<br>
automata for system analysis and programme verification<br>
automata networks<br>
automatic structures<br>
codes<br>
combinatorics on words<br>
computational complexity<br>
concurrency and Petri nets<br>
data and image compression<br>
descriptional complexity<br>
foundations of finite state technology<br>
foundations of XML<br>
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)<br>
grammatical inference and algorithmic learning<br>
graphs and graph transformation<br>
language varieties and semigroups<br>
language-based cryptography<br>
mathematical and logical foundations of programming methodologies<br>
parallel and regulated rewriting<br>
parsing<br>
patterns<br>
power series<br>
string processing algorithms<br>
symbolic dynamics<br>
term rewriting<br>
transducers<br>
trees, tree languages and tree automata<br>
weighted automata<br>
<br><strong>STRUCTURE:</strong><br>
<br>
LATA 2019 will consist of:<br>
<br>
invited talks<br>
peer-reviewed contributions<br>
<br><strong>INVITED SPEAKERS:</strong><br>
<br>
tba<br>
<br><strong>PROGRAMME COMMITTEE:</strong><br>
<br>
Krishnendu Chatterjee (Institute of Science and Technology Austria, AT)<br>
Bruno Courcelle (University of Bordeaux, FR)<br>
Manfred Droste (University of Leipzig, DE)<br>
Travis Gagie (Diego Portales University, CL)<br>
Peter Habermehl (Paris Diderot University, FR)<br>
Tero Harju (University of Turku, FI)<br>
Radu Iosif (Verimag, FR)<br>
Kazuo Iwama (Kyoto University, JP)<br>
Juhani Karhumäki (University of Turku, FI)<br>
Lila Kari (University of Waterloo, CA)<br>
Juha Kärkkäinen (University of Helsinki, FI)<br>
Bakhadyr Khoussainov (University of Auckland, NZ)<br>
Sergey Kitaev (University of Strathclyde, UK)<br>
Shmuel Tomi Klein (Bar-Ilan University, IL)<br>
Olga Kouchnarenko (University of Franche-Comté, FR)<br>
Thierry Lecroq (University of Rouen, FR)<br>
Markus Lohrey (University of Siegen, DE)<br>
Sebastian Maneth (University of Bremen, DE)<br>
Carlos Martín-Vide (Rovira i Virgili University, ES, chair)<br>
Giancarlo Mauri (University of Milano-Bicocca, IT)<br>
Filippo Mignosi (University of L'Aquila, IT)<br>
Victor Mitrana (Polytechnic University of Madrid, ES)<br>
Joachim Niehren (INRIA Lille, FR)<br>
Alexander Okhotin (Saint Petersburg State University, RU)<br>
Dominique Perrin (University of Paris-Est, FR)<br>
Matteo Pradella (Polytechnic University of Milan, IT)<br>
Jean-François Raskin (Université Libre de Bruxelles, BE)<br>
Marco Roveri (Bruno Kessler Foundation, IT)<br>
Wojciech Rytter (University of Warsaw, PL)<br>
Kai Salomaa (Queen's University, CA)<br>
Sven Schewe (University of Liverpool, UK)<br>
Helmut Seidl (Technical University of Munich, DE)<br>
Ayumi Shinohara (Tohoku University, JP)<br>
Hans Ulrich Simon (Ruhr-University of Bochum, DE)<br>
William F. Smyth (McMaster University, CA)<br>
Frank Stephan (National University of Singapore, SG)<br>
Martin Sulzmann (Karlsruhe University of Applied Sciences, DE)<br>
Jorma Tarhio (Aalto University, FI)<br>
Stefano Tonetta (Bruno Kessler Foundation, IT)<br>
Rob van Glabbeek (University of New South Wales, AU)<br>
Margus Veanes (Microsoft Research, US)<br>
Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US)<br>
Mikhail Volkov (Ural Federal University, RU)<br>
Fang Yu (National Chengchi University, TW)<br>
Hans Zantema (Eindhoven University of Technology, NL)<br>
<br><strong>ORGANIZING COMMITTEE:</strong><br>
<br>
Alexander Okhotin (Saint Petersburg, co-chair)<br>
Manuel Parra-Royón (Granada)<br>
Dana Shapira (Ariel)<br>
David Silva (London, co-chair)<br>
<br><strong>SUBMISSIONS:</strong><br>
<br>
Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix.<br>
<br>
Submissions have to be uploaded to:<br>
<br>
https://easychair.org/conferences/?conf=lata2019<br>
<br><strong>PUBLICATIONS:</strong><br>
<br>
A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.<br>
<br>
A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.<br>
<br><strong>REGISTRATION:</strong><br>
<br>
The registration form can be found at:<br>
<br>
http://lata2019.irdta.eu/Registration.php<br>
<br><strong>DEADLINES </strong>(all at 23:59 CET)<strong>:</strong><br>
<br>
Paper submission: November 11, 2018<br>
Notification of paper acceptance or rejection: December 16, 2018<br>
Final version of the paper for the LNCS proceedings: December 23, 2018<br>
Early registration: December 23, 2018<br>
Late registration: March 11, 2019<br>
Submission to the journal special issue: June 29, 2019<br>
<br><strong>QUESTIONS AND FURTHER INFORMATION:</strong><br>
<br>
david (at) irdta.eu<br>
<br><strong>ACKNOWLEDGMENTS:</strong><br>
<br>
Санкт-Петербургский государственный университет<br>
<br>
IRDTA – Institute for Research Development, Training and Advice, Brussels/London</body></html>