Editorial Board
Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015
Complexity of regular functions
Automated synthesis of application-layer connectors from automata-based specifications
A Nivat theorem for weighted picture automata and weighted MSO logics
Recognizable series on graphs and hypergraphs
A game characterisation of tree-like Q-Resolution size
Recurrence relations, succession rules and the positivity problem
Efficient enumeration of weighted tree languages over the tropical semiring
Towards more precise rewriting approximations
Logics for unordered trees with data constraints
Linking indexing data structures to de Bruijn graphs: Construction and update
Sorting networks: To the end and back again
Bounding clique-width via perfect graphs
Two parallel algorithms for finding all minimal maximum subsequences
Insertion operations on deterministic reversal-bounded counter machines
Coverability and multi-scale coverability on infinite pictures
One-variable context-free hedge automata
Classifying invariant structures of step traces
Derivatives and partial derivatives for regular shuffle expressions
Complexity of road coloring with prescribed reset words
Distributional learning of conjunctive grammars and contextual binary feature grammars