13th International Conference on Language and Automata Theory and Applications

LATA 2019

Saint Petersburg, Russia - March 25-29, 2019

Deadlines (all at 23:59 CET)

11th November, 2018Paper submission
18th November, 2018Paper submission - EXTENDED
16th December, 2018Notification of paper acceptance or rejection
23rd December, 2018Final version of the paper for the LNCS proceedings
23rd December, 2018Early registration
11th March, 2019Late registration
29th June, 2019Submission to the journal special issue

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 venue will be Saint Petersburg State University.

STRUCTURE

LATA 2019 will consist of:

  • ▸ invited talks
  • ▸ peer-reviewed contributions

QUESTIONS AND FURTHER INFORMATION

david (at) irdta.eu

ACKNOWLEDGMENTS

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

IRDTA – Institute for Research Development, Training and Advice, Brussels/London (http://www.irdta.eu)

CONFERENCE PARTNER

See our conference and other related conferences and journals on

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

PUBLICATIONS

A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.

Springer LNCS

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.