Topics of either theoretical or applied interest include, but are not limited to:<br>algebraic language theory<br>algorithms for semi–structured data mining<br>algorithms on automata and words<br>automata and logic<br>automata for system analysis and programme verification<br>automata networks<br>automata, concurrency and Petri nets<br>automatic structures<br>cellular automata<br>codes<br>combinatorics on words<br>computational complexity<br>data and image compression<br>descriptional complexity<br>digital libraries and document engineering<br>foundations of finite state technology<br>foundations of XML<br>fuzzy and rough languages<br>grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)<br>grammatical inference and algorithmic learning<br>graphs and graph transformation<br>language varieties and semigroups<br>language–based cryptography<br>parallel and regulated rewriting<br>parsing<br>patterns<br>power series<br>string and combinatorial issues in bioinformatics<br>string processing algorithms<br>symbolic dynamics<br>term rewriting<br>transducers<br>trees, tree languages and tree automata<br>unconventional models of computation<br>weighted automata<br>
Abbrevation
LATA
City
Nice
Country
France
Deadline Paper
Start Date
End Date
Abstract