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

Organised by

• Research Group on Implementation of Language-Driven Software and Applications (ILSA) from Complutense University of Madrid
• Research Group on Mathematical Linguistics (GRLMC) from Rovira i Virgili University

Aims

LATA is a yearly conference 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 2014 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, language technology, artificial intelligence, etc.).

Venue

LATA 2014 will take place in Madrid, the capital of Spain. The venue will be the School of Informatics of Complutense University.

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 program verification
• automata, concurrency and Petri nets
• automatic structures
• cellular automata
• codes
• combinatorics on words
• compilers
• computability
• computational complexity
• data and image compression
• decidability issues on words and languages
• descriptional complexity
• digital libraries and document engineering
• DNA and other models of bio‐inspired computing
• 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
• language-theoretic foundations of artificial intelligence and artificial life
• natural language and speech automatic processing
• parallel and regulated rewriting
• parsing
• patterns
• power series
• quantum, chemical and optical computing
• semantics
• string and combinatorial issues in computational biology and bioinformatics
• string processing algorithms
• symbolic dynamics
• symbolic neural networks
• term rewriting
• transducers
• trees, tree languages and tree automata
• weighted automata

Structure of the Conference

LATA 2014 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) and should be formatted according to the standard format for Springer Verlag's LNCS series. Submissions have to be uploaded to: https://www.easychair.org/conferences/?conf=lata2014.

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.