Abstract. We give a formal concept of (right) wide Morita context between two 0-cells in arbitrary bicategory. We then construct a new bicategory with the same 0-cells as the oldest one, and with 1-cells all these (right) wide Morita contexts. An application to the (right) Eilenberg-Moore bicategory of comonads associated to the bimodules bicategory is also given.

Abstract. Bruguières, Lack and Virelizier have recently obtained a vast generalization of Sweedler’s Fundamental Theorem of Hopf modules, in which the role of the Hopf algebra is played by a bimonad. We present an extension of this result which involves, in addition to the bimonad, a comodule-monad and a algebra-comonoid over it. As an application we obtain a generalization of another classical theorem from the Hopf algebra literature, due to Schneider, which itself is an extension of Sweedler’s result (to the setting of Hopf Galois extensions).

Abstract. The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behavioural equivalence (∼F) amongst them. Many types of transition systems and their equivalences can be captured by a functor F. For example, for deterministic automata the derived equivalence is language equivalence, while for non-deterministic automata it is ordinary bisimilarity. We give several examples of applications of our generalized determinization construction, including partial Mealy machines, (structured) Moore automata, Rabin probabilistic automata, and, somewhat surprisingly, even pushdown automata. To further witness the generality of the approach we show how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready