569 research outputs found

    Coequations and Eilenberg–type Correspondences

    No full text
    Contains fulltext : 187333.pdf (Publisher’s version ) (Open Access)Radboud University, 24 april 2018Promotor : Rutten, J.J.M.M. Co-promotor : Bonsangue, M.M.206 p

    Formal models for component connectors

    No full text
    Rutten, J.J.M.M. [Promotor]Arbab, F. [Promotor]Niqui, M. [Copromotor]Clarke, D.G. [Copromotor

    Coalgebraic characterizations of automata-theoretic classes

    No full text
    Contains fulltext : 127519.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 01 juli 2014Promotor : Rutten, J.J.M.M. Co-promotor : Bonsangue, M.M.168 p

    Coalgebraic tools for bisimilarity and decorated trace semantics

    No full text
    Contains fulltext : 120149.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 16 december 2013Promotores : Rutten, J.J.M.M., Ingolfsdottir, A. Co-promotores : Martins Da Silva, A., Bonsangue, M.119 p

    Errata to "Formations of Monoids, Congruences, and Formal Languages"

    No full text
    [1] A. Ballester-Bolinches, E. Cosme-Llópez, R. Esteban Romero, and J.J.M.M. Rutten. Formations of monoids, congruences, and formal languages. Scientific Annals of Computer Science, 25(2):171–209, 2015. doi:10.7561/SACS.2015.2.171

    Elements of generalized ultrametric domain theory

    No full text
    AbstractGeneralized ultrametric spaces are a common generalization of preorders and ordinary ultrametric spaces, as was observed by Lawvere (1973). Guided by his enriched-categorical view on (ultra)metric spaces, we generalize the standard notions of Cauchy sequence and limit in an (ultra)metric space, and of adjoint pair between preorders. This leads to a solution method for recursive domain equations that combines and extends the standard order-theoretic (Smyth and Plotkin, 1982) and metric (America and Rutten, 1989) approaches
    corecore