<!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 2018: 2nd 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>12th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS</strong><br>
<br><strong>LATA 2018</strong><br>
<br><strong>Bar-Ilan near Tel Aviv, Israel</strong><br>
<br><strong>April 8-12, 2018</strong><br>
<br>
Organized by:<br>
<br>
Department of Computer Science<br>
Bar-Ilan University<br>
<br>
Research Group on Mathematical Linguistics (GRLMC)<br>
Rovira i Virgili University<br>
<br>
http://grammars.grlmc.com/LATA2018/<br>
************************************************************************<br>
<br><strong>AIMS:</strong><br>
<br>
LATA is a conference series on theoretical computer science and its applications. Following the tradition of the diverse PhD training events in the field organized by Rovira i Virgili University since 2002, LATA 2018 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 2018 will take place in Ramat Gan, in the district of Tel Aviv and home to one of the world's major diamond exchanges. The venue will be the Faculty of Exact Sciences of Bar-Ilan 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 2018 will consist of:<br>
<br>
invited talks<br>
peer-reviewed contributions<br>
<br><strong>INVITED SPEAKERS:</strong><br>
<br>
Andrei Bulatov (Simon Fraser University), Constraint Satisfaction Problems and Their Complexity (tutorial)<br>
<br>
Markus Lohrey (University of Siegen), Streaming Algorithms in Formal Language Theory<br>
<br>
Alexander Okhotin (Saint Petersburg State University), tba<br>
<br>
Eli Shamir (Hebrew University of Jerusalem), Reshaping the Context-free Model: Linguistic and Algorithmic Aspects<br>
<br>
James Worrell (University of Oxford), Invariants for Linear Loops<br>
<br><strong>PROGRAMME COMMITTEE:</strong><br>
<br>
Christel Baier (Technical University of Dresden, DE)<br>
Pablo Barceló (University of Chile, CL)<br>
Francine Blanchet-Sadri (University of North Carolina, Greensboro, US)<br>
Alexander Clark (King's College London, UK)<br>
Frank Drewes (Umeå University, SE)<br>
Manfred Droste (University of Leipzig, DE)<br>
Dora Giammarresi (University of Rome Tor Vergata, IT)<br>
Erich Grädel (RWTH Aachen University, DE)<br>
Peter Habermehl (Paris Diderot University, FR)<br>
Jeffrey Heinz (Stony Brook University, US)<br>
Pedro Rangel Henriques (University of Minho, PT)<br>
Christian Höner zu Siederdissen (University of Leipzig, DE)<br>
Hendrik Jan Hoogeboom (Leiden University, NL)<br>
David Janin (University of Bordeaux, FR)<br>
Marcin Jurdziński (University of Warwick, UK)<br>
Makoto Kanazawa (National Institute of Informatics, JP)<br>
Jarkko Kari (University of Turku, FI)<br>
Shmuel Tomi Klein (Bar-Ilan University, IL)<br>
Salvatore La Torre (University of Salerno, IT)<br>
Salvador Lucas (Polytechnic University of Valencia, ES)<br>
Stuart W. Margolis (Bar-Ilan University, IL)<br>
Carlos Martín-Vide (Rovira i Virgili University, ES, chair)<br>
Fernando Orejas (Polytechnic University of Catalonia, ES)<br>
Paritosh K. Pandya (Tata Institute of Fundamental Research, IN)<br>
Gennaro Parlato (University of Southampton, UK)<br>
Dominique Perrin (University Paris-Est Marne-la-Vallée, FR)<br>
Detlef Plump (University of York, UK)<br>
Matteo Pradella (Polytechnic University of Milan, IT)<br>
Arend Rensink (University of Twente, NL)<br>
Kai Salomaa (Queen's University, CA)<br>
Sven Schewe (University of Liverpool, UK)<br>
Helmut Seidl (Technical University of Munich, DE)<br>
William F. Smyth (McMaster University, CA)<br>
Jiri Srba (Aalborg University, DK)<br>
Benjamin Steinberg (City College of New York, US)<br>
Frank Stephan (National University of Singapore, SG)<br>
K.G. Subramanian (University Sains Malaysia, MY)<br>
Klaus Sutner (Carnegie Mellon University, US)<br>
Menno van Zaanen (Tilburg University, NL)<br>
Margus Veanes (Microsoft Research, US)<br>
Éric Villemonte de la Clergerie (INRIA, FR)<br>
Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US)<br>
Mikhail Volkov (Ural State University, RU)<br>
<br><strong>ORGANIZING COMMITTEE:</strong><br>
<br>
Shmuel Tomi Klein (Ramat Gan, co-chair)<br>
Carlos Martín-Vide (Tarragona, co-chair)<br>
Manuel Jesús Parra Royón (Granada)<br>
Dana Shapira (Ariel)<br>
David Silva (London)<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=lata2018<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 the journal Information and Computation (Elsevier, 2016 JCR impact factor: 1.05) 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://grammars.grlmc.com/LATA2018/Registration.php<br>
<br><strong>DEADLINES </strong>(all at 23:59 CET)<strong>:</strong><br>
<br>
Paper submission: November 17, 2017<br>
Notification of paper acceptance or rejection: December 24, 2017<br>
Final version of the paper for the LNCS proceedings: January 4, 2018<br>
Early registration: January 4, 2018<br>
Late registration: March 25, 2018<br>
Submission to the journal special issue: July 12, 2018<br>
<br><strong>QUESTIONS AND FURTHER INFORMATION:</strong><br>
<br>
david.silva409 (at) yahoo.com<br>
<br><strong>POSTAL ADDRESS:</strong><br>
<br>
LATA 2018<br>
Research Group on Mathematical Linguistics (GRLMC)<br>
Rovira i Virgili University<br>
Av. Catalunya, 35<br>
43002 Tarragona, Spain<br>
<br><strong>ACKNOWLEDGMENTS:</strong><br>
<br>
אוניברסיטת בר-אילן<br>
Universitat Rovira i Virgili</body></html>