<!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 2020 & 2021: 3rd 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>14<sup>th</sup>-15<sup>th</sup> INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS</strong><br>
<br><strong>LATA 2020 & 2021</strong><br>
<br><strong>Milan, Italy</strong><br>
<br><strong>March 1-5, 2021</strong><br>
<br>
Co-organized by:<br>
<br>
Department of Informatics, Systems and Communication<br>
University of Milano-Bicocca<br>
<br>
and<br>
<br>
Institute for Research Development, Training and Advice<br>
Brussels/London<br>
<br>
https://irdta.eu/lata2020-2021/<br>
*******************************************************************************<br>
<br><strong>AIMS:</strong><br>
<br>
LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 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>
LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion.<br>
<br><strong>VENUE:</strong><br>
<br>
LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be:<br>
<br>
University of Milano-Bicocca<br>
Viale Piero e Alberto Pirelli 22<br>
Building U6<br>
Aula Mario Martini (Aula U6-04)<br>
Milan<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, inductive 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 2020 & 2021 will consist of:<br>
<br>
invited talks<br>
peer-reviewed contributions<br>
<br><strong>KEYNOTE SPEAKERS:</strong><br>
<br>
Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization<br>
<br>
Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata<br>
<br>
Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata<br>
<br>
Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data<br>
<br>
Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free?<br>
<br>
Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View<br>
<br><strong>PROGRAMME COMMITTEE:</strong><br>
<br>
Jorge Almeida (University of Porto, PT)<br>
Franz Baader (Technical University of Dresden, DE)<br>
Alessandro Barenghi (Polytechnic University of Milan, IT)<br>
Marie-Pierre Béal (University of Paris-Est, FR)<br>
Djamal Belazzougui (CERIST, DZ)<br>
Marcello Bonsangue (Leiden University, NL)<br>
Flavio Corradini (University of Camerino, IT)<br>
Bruno Courcelle (University of Bordeaux, FR)<br>
Laurent Doyen (ENS Paris-Saclay, FR)<br>
Manfred Droste (Leipzig University, DE)<br>
Rudolf Freund (Technical University of Vienna, AT)<br>
Paweł Gawrychowski (University of Wrocław, PL)<br>
Amélie Gheerbrant (Paris Diderot University, FR)<br>
Tero Harju (University of Turku, FI)<br>
Lane A. Hemaspaandra (University of Rochester, US)<br>
Jarkko Kari (University of Turku, FI)<br>
Dexter Kozen (Cornell University, US)<br>
Markus Lohrey (University of Siegen, DE)<br>
Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US)<br>
Sebastian Maneth (University of Bremen, DE)<br>
Nicolas Markey (IRISA, Rennes, FR)<br>
Carlos Martín-Vide (Rovira i Virgili University, ES, chair)<br>
Giancarlo Mauri (University of Milano-Bicocca, IT)<br>
Victor Mitrana (University of Bucharest, RO)<br>
Paliath Narendran (University at Albany, US)<br>
Gennaro Parlato (University of Molise, IT)<br>
Dominique Perrin (University of Paris-Est, FR)<br>
Nir Piterman (Chalmers University of Technology, SE)<br>
Sanguthevar Rajasekaran (University of Connecticut, US)<br>
Antonio Restivo (University of Palermo, IT)<br>
Wojciech Rytter (University of Warsaw, PL)<br>
Kai Salomaa (Queen’s University, CA)<br>
Helmut Seidl (Technical University of Munich, DE)<br>
William F. Smyth (McMaster University, CA)<br>
Jiří Srba (Aalborg University, DK)<br>
Edward Stabler (University of California, Los Angeles, US)<br>
Benjamin Steinberg (City University of New York, US)<br>
Frank Stephan (National University of Singapore, SG)<br>
Jan van Leeuwen (Utrecht University, NL)<br>
Margus Veanes (Microsoft Research, US)<br>
Mikhail Volkov (Ural Federal University, RU)<br>
<br><strong>ORGANIZING COMMITTEE:</strong><br>
<br>
Alberto Leporati (Milan, co-chair)<br>
Sara Morales (Brussels)<br>
Manuel Parra-Royón (Granada)<br>
Rafael Peñaloza Nyssen (Milan)<br>
Dana Shapira (Ariel)<br>
David Silva (London, co-chair)<br>
Bianca Truthe (Giessen)<br>
Claudio Zandron (Milan, 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>
Upload submissions to:<br>
<br>
https://easychair.org/conferences/?conf=lata20202021<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 Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) 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>
https://irdta.eu/lata2020-2021/registration/<br>
<br><strong>DEADLINES </strong>(all at 23:59 CET)<strong>:</strong><br>
<br>
Paper submission: October 19, 2020<br>
Notification of paper acceptance or rejection: November 23, 2020<br>
Final version of the paper for the LNCS proceedings: November 30, 2020<br>
Early registration: November 30, 2020<br>
Late registration: February 15, 2021<br>
Submission to the journal special issue: June 5, 2021<br>
<br><strong>QUESTIONS AND FURTHER INFORMATION:</strong><br>
<br>
david (at) irdta.eu<br>
<br><strong>ACKNOWLEDGMENTS:</strong><br>
<br>
Università degli Studi di Milano-Bicocca<br>
<br>
IRDTA – Institute for Research Development, Training and Advice, Brussels/London<br>
</body></html>