Editorial Board
Simple characterizations of P(#P) and complete problems
Group structured linear cellular automata over Zm
The random oracle hypothesis is false
Time-extraction for temporal logic-logic programming and local process time
The complexity of connectivity problems on context-free graph languages
Symmetry in self-correcting cellular automata
Characterizing language identification by standardizing operations
Bounded degree graph inference from walks
A kleene-like characterization of languages accepted by systolic tree automata