On rearrangeable and non-blocking switching networks
On the decidability of homomorphism equivalence for languages
(A-)synchronous (non-)deterministic cell spaces simulating each other
Realization of finite automata with linear parts
A note on “indecomposable parallel maps” by S. Amoroso and I.J. Epstein
Tω as a Universal Domain
A note on asynchronous cellular automata
The complexity of total order structures
Candidate keys for relations