Proceedings available online as volume LNCS 9618.
Information about it at http://www.springer.com/978-3-319-29999-0 or access the online version.

Organised by

• Department of Theoretical Computer Science,
  Faculty of Information Technology,
  Czech Technical University in Prague and
• Research Group on Mathematical Linguistics (GRLMC),
  Rovira i Virgili University

Aims

LATA is a conference series on theoretical computer science and its applications. Following the tradition of the diverse PhD training events in the field developed at Rovira i Virgili University in Tarragona since 2002, LATA 2016 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 2016 will take place in Prague, a city full of history and cultural attractions, and one of the political and economic cores of central Europe. The venue will be the campus of the Czech Technical University in the Dejvice quarter.

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
• automata, concurrency and Petri nets
• automatic structures
• cellular automata
• codes
• combinatorics on words
• computational complexity
• data and image compression
• descriptional complexity
• digital libraries and document engineering
• foundations of finite state technology
• foundations of XML
• fuzzy and rough languages
• 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 and combinatorial issues in bioinformatics
• string processing algorithms
• symbolic dynamics
• term rewriting
• transducers
• trees, tree languages and tree automata
• unconventional models of computation
• weighted automata

Structure of the Conference

LATA 2016 will consist of

• invited talks
• invited tutorials
• peer-reviewed contributions

Submission

Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single‐spaced pages (including eventual appendices, references, proofs, etc.) and should be prepared according to the standard format for Springer Verlag's LNCS series. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2016.

Registration

The registration form can be found here.

We kindly ask all the participants to register, including invited persons and members of the organising committee.