Preface L. Aceto and L. Birkedal | ||
On the Complexity of Equivalence and Minimisation for Q-weighted Automata | ||
Stefan Kiefer, Andrzej Murawski, Joël Ouaknine, Björn Wachter and James Worrell | ||
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata | ||
Sebastian Preugschat and Thomas Wilke | ||
Well-Pointed Coalgebras | ||
Jiří Adámek, Stefan Milius, Lawrence S. Moss and Lurdes Sousa | ||
On Characterising Distributability | ||
Rob J. van Glabbeek, Ursula Goltz and Jens-Wolfhard Schicke-Uffmann | ||
When is a container a comonad? | ||
Danel Ahman, James Chapman and Tarmo Uustalu | ||