12th International Conference on Language and Automata Theory and Applications (LATA 2018)

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