Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Petrişan, Daniela"'
The Kantorovich distance is a widely used metric between probability distributions. The Kantorovich-Rubinstein duality states that it can be defined in two equivalent ways: as a supremum, based on non-expansive functions into [0, 1], and as an infimu
Externí odkaz:
http://arxiv.org/abs/2411.12333
Autor:
Petrisan, Daniela Luana
The last decade has seen a surge of interest in nominal sets and their applications to formal methods for programming languages. This thesis studies two subjects: algebra and duality in the nominal setting. In the first part, we study universal algeb
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548395
Autor:
Petrişan, Daniela, Sarkis, Ralph
Publikováno v:
EPTCS 351, 2021, pp. 218-241
Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the associativi
Externí odkaz:
http://arxiv.org/abs/2106.13489
In this paper, we present a categorical approach to learning automata over words, in the sense of the $L^*$-algorithm of Angluin. This yields a new generic $L^*$-like algorithm which can be instantiated for learning deterministic automata, automata w
Externí odkaz:
http://arxiv.org/abs/2010.13675
Autor:
Goy, Alexandre, Petrisan, Daniela
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution monad. Thi
Externí odkaz:
http://arxiv.org/abs/2010.00811
Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural equivalences. We introduce up-to techniques for behavioural metrics between systems modelled as coalgebras and we provide abstract results to prove their oundnes
Externí odkaz:
http://arxiv.org/abs/1806.11064
Autor:
Colcombet, Thomas, Petrişan, Daniela
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 1 (March 23, 2020) lmcs:4159
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the
Externí odkaz:
http://arxiv.org/abs/1712.07121
Autor:
Colcombet, Thomas, Petrişan, Daniela
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata and autom
Externí odkaz:
http://arxiv.org/abs/1711.06065
Publikováno v:
Math. Struct. Comp. Sci. 30 (2020) 1054-1088
This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one layer of var
Externí odkaz:
http://arxiv.org/abs/1702.08841