State morphism MV-algebras

We present a complete characterization of subdirectly irreducible MV-algebras with internal states (SMV-algebras). This allows us to classify subdirectly irreducible state morphism MV-algebras (SMMV-algebras) and describe single generators of the variety of SMMV-algebras, and show that we have a continuum of varieties of SMMV-algebras

Loomis--Sikorski Theorem and Stone Duality for Effect Algebras with Internal State

Recently Flaminio and Montagna, \cite{FlMo}, extended the language of MV-algebras by adding a unary operation, called a state-operator. This notion is introduced here also for effect algebras. Having it, we generalize the Loomis--Sikorski Theorem for monotone $\sigma$-complete effect algebras with internal state. In addition, we show that the category of divisible state-morphism effect algebras satisfying (RDP) and countable interpolation with an order determining system of states is dual to the category of Bauer simplices $\Omega$ such that $\partial_e \Omega$ is an F-space

Two-valued states on Baer ∗^*-semigroups

In this paper we develop an algebraic framework that allows us to extend families of two-valued states on orthomodular lattices to Baer $^*$-semigroups. We apply this general approach to study the full class of two-valued states and the subclass of Jauch-Piron two-valued states on Baer $^*$-semigroups.Comment: Reports on mathematical physics (accepted 2013

Towards a Uniform Theory of Effectful State Machines

Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata. They are instances of Jacobs' notion of a T-automaton, where T is a monad. We show that the generic language semantics for T-automata correctly instantiates the usual language semantics for a number of known classes of machines/languages, including regular, context-free, recursively-enumerable and various subclasses of context free languages (e.g. deterministic and real-time ones). Moreover, our approach provides new generic techniques for studying the expressivity power of various machine-based models.Comment: final version accepted by TOC