LATA 2013 - 7th International Conference on Language and Automata Theory and Applications

LATA is a yearly conference in theoretical computer science and its applications organized by Research Group on Mathematical Linguistics (GRLMC).

Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2013 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, systems biology, language technology, artificial intelligence, etc.).

Venue
LATA 2013 will take place in Bilbao, at the Basque Country in Northern Spain. The venue will be the Basque Center for Applied Mathematics (BCAM).

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
combinatorics on words
computability
computational complexity
computational linguistics
data and image compression
decidability questions on words and languages
descriptional complexity
DNA and other models of bio‐inspired computing
document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
grammars and automata architectures
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
parallel and regulated rewriting
parsing
pattern recognition
patterns and codes
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
Submission
Authors are invited to submit papers 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=lata20....

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 a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.