CHI-ANNOUNCEMENTS Archives

ACM SIGCHI General Interest Announcements (Mailing List)

CHI-ANNOUNCEMENTS@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
"ACM SIGCHI General Interest Announcements (Mailing List)" <[log in to unmask]>
X-To:
Date:
Fri, 9 Nov 2018 04:24:18 +0100
Reply-To:
Subject:
MIME-Version:
1.0
Message-ID:
<545102060a010b0409545603000a5a0652050105065252030a575a030150525555530356565d065709550057050605@grlmc_ip-zone_com-6>
Content-Transfer-Encoding:
quoted-printable
Content-Type:
text/plain; charset="UTF-8"
From:
Parts/Attachments:
text/plain (365 lines)

LATA 2019: extended submission deadline November 18*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*

 

------------------------------------------------------------------------------

***** SUBMISSION DEADLINE EXTENDED: November 18 *****

------------------------------------------------------------------------------

 

*************************************************************************
13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS

 
LATA 2019

 
Saint Petersburg, Russia

 
March 25-29, 2019

 

Organized by:

           

Saint Petersburg State University

and

Institute for Research Development, Training and Advice, Brussels/London

 

http://lata2019.irdta.eu/

*************************************************************************

 
AIMS:

 

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.

 
VENUE:

 

LATA 2019 will take place in Saint Petersburg, whose historic centre is a UNESCO World Heritage Site. The conference site shall be the historical Twelve Collegia building (https://en.wikipedia.org/wiki/Twelve_Collegia), built in ca. 1740,

which was used for the Russian government in the 18th century, and which

has been the main building of Saint Petersburg State University since 1835.

 
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 networks

automatic structures

codes

combinatorics on words

computational complexity

concurrency and Petri nets

data and image compression

descriptional complexity

foundations of finite state technology

foundations of XML

grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)

grammatical inference and algorithmic learning

graphs and graph transformation

language varieties and semigroups

language-based cryptography

mathematical and logical foundations of programming methodologies

parallel and regulated rewriting

parsing

patterns

power series

string processing algorithms

symbolic dynamics

term rewriting

transducers

trees, tree languages and tree automata

weighted automata

 
STRUCTURE:

 

LATA 2019 will consist of:

 

invited talks

peer-reviewed contributions

 
INVITED SPEAKERS:

 

Henning Fernau (University of Trier), Modern Aspects of Complexity within Formal Languages

 

Paweł Gawrychowski (University of Wrocław), tba

 

Edward A. Lee (University of California, Berkeley), Observation, Interaction, Determinism, and Free Will

 

Vadim Lozin (University of Warwick), From Words to Graphs, and Back

 

Esko Ukkonen (University of Helsinki), Pattern Discovery in Biological Sequences

 
PROGRAMME COMMITTEE:

 

Krishnendu Chatterjee (Institute of Science and Technology Austria, AT)

Bruno Courcelle (University of Bordeaux, FR)

Manfred Droste (University of Leipzig, DE)

Travis Gagie (Diego Portales University, CL)

Peter Habermehl (Paris Diderot University, FR)

Tero Harju (University of Turku, FI)

Markus Holzer (University of Giessen, DE)

Radu Iosif (Verimag, FR)

Kazuo Iwama (Kyoto University, JP)

Juhani Karhumäki (University of Turku, FI)

Lila Kari (University of Waterloo, CA)

Juha Kärkkäinen (University of Helsinki, FI)

Bakhadyr Khoussainov (University of Auckland, NZ)

Sergey Kitaev (University of Strathclyde, UK)

Shmuel Tomi Klein (Bar-Ilan University, IL)

Olga Kouchnarenko (University of Franche-Comté, FR)

Thierry Lecroq (University of Rouen, FR)

Markus Lohrey (University of Siegen, DE)

Sebastian Maneth (University of Bremen, DE)

Carlos Martín-Vide (Rovira i Virgili University, ES, chair)

Giancarlo Mauri (University of Milano-Bicocca, IT)

Filippo Mignosi (University of L'Aquila, IT)

Victor Mitrana (Polytechnic University of Madrid, ES)

Joachim Niehren (INRIA Lille, FR)

Alexander Okhotin (Saint Petersburg State University, RU)

Dominique Perrin (University of Paris-Est, FR)

Matteo Pradella (Polytechnic University of Milan, IT)

Jean-François Raskin (Université Libre de Bruxelles, BE)

Marco Roveri (Bruno Kessler Foundation, IT)

Karen Rudie (Queen's University, CA)

Wojciech Rytter (University of Warsaw, PL)

Kai Salomaa (Queen's University, CA)

Sven Schewe (University of Liverpool, UK)

Helmut Seidl (Technical University of Munich, DE)

Ayumi Shinohara (Tohoku University, JP)

Hans Ulrich Simon (Ruhr-University of Bochum, DE)

William F. Smyth (McMaster University, CA)

Frank Stephan (National University of Singapore, SG)

Martin Sulzmann (Karlsruhe University of Applied Sciences, DE)

Jorma Tarhio (Aalto University, FI)

Stefano Tonetta (Bruno Kessler Foundation, IT)

Rob van Glabbeek (Data61, CSIRO, AU)

Margus Veanes (Microsoft Research, US)

Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US)

Mikhail Volkov (Ural Federal University, RU)

Fang Yu (National Chengchi University, TW)

Hans Zantema (Eindhoven University of Technology, NL)

 
ORGANIZING COMMITTEE:

 

Alexander Okhotin (Saint Petersburg, co-chair)

Manuel Parra-Royón (Granada)

Dana Shapira (Ariel)

David Silva (London, co-chair)

 
SUBMISSIONS:

 

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.

 

Submissions have to be uploaded to:

 

https://easychair.org/conferences/?conf=lata2019

 
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 the journal Information and Computation (Elsevier, 2017 JCR impact factor: 0.66) 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.

 
REGISTRATION:

 

The registration form can be found at:

 

http://lata2019.irdta.eu/Registration.php

 
DEADLINES (all at 23:59 CET):

 

Paper submission: November 18, 2018 – EXTENDED –

Notification of paper acceptance or rejection: December 16, 2018

Final version of the paper for the LNCS proceedings: December 23, 2018

Early registration: December 23, 2018

Late registration: March 11, 2019

Submission to the journal special issue: June 29, 2019

 
QUESTIONS AND FURTHER INFORMATION:

 

david (at) irdta.eu

 
ACKNOWLEDGMENTS:

 

Санкт-Петербургский государственный университет

 

IRDTA – Institute for Research Development, Training and Advice, Brussels/London

 


    ---------------------------------------------------------------
    For news of CHI books, courses & software, join CHI-RESOURCES
     mailto: [log in to unmask]

    To unsubscribe from CHI-ANNOUNCEMENTS send an email to
     mailto:[log in to unmask]

    For further details of CHI lists see http://listserv.acm.org
    ---------------------------------------------------------------

ATOM RSS1 RSS2