Editorial Board
On the equivalence of mealy-type and moore-type automata and a relation between reducibility and moore-reducibility
On topological machines
Synchronization and computing capabilities of linear asynchronous structures
Techniques for separating space complexity classes
Relating refined space complexity classes
Hypergrammars: An extension of macrogrammars
A semigroup characterization of a linearly realizable automaton over GF(p)