Zobrazeno 1 - 10
of 270
pro vyhledávání: '"Filiot A"'
Gathering histopathology slides from over 100 publicly available cohorts, we compile a diverse dataset of 460 million pathology tiles covering more than 30 cancer sites. Using this dataset, we train a large self-supervised vision transformer using DI
Externí odkaz:
http://arxiv.org/abs/2409.09173
Autor:
Filiot, Emmanuel, Jecker, Ismaël, Puppis, Gabriele, Löding, Christof, Muscholl, Anca, Winter, Sarah
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuedness entails decidability of the equivalence problem. This decidability r
Externí odkaz:
http://arxiv.org/abs/2405.08171
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller streaming str
Externí odkaz:
http://arxiv.org/abs/2302.06672
We study a variant of the problem of synthesizing Mealy machines that enforce LTL specifications against all possible behaviours of the environment including hostile ones. In the variant studied here, the user provides the high level LTL specificatio
Externí odkaz:
http://arxiv.org/abs/2301.10485
The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more complex abstract machines: we introduce a new notion of delay tailore
Externí odkaz:
http://arxiv.org/abs/2205.04287
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by adding regist
Externí odkaz:
http://arxiv.org/abs/2205.01952
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by adding regist
Externí odkaz:
http://arxiv.org/abs/2105.09978
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose executions are represented as finite words in $(I\times O)^*$, where $I,O$ are
Externí odkaz:
http://arxiv.org/abs/2103.05550
Autor:
Filiot, Emmanuel, Winter, Sarah
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computabil
Externí odkaz:
http://arxiv.org/abs/2103.05674
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (July 29, 2022) lmcs:7104
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can produce th
Externí odkaz:
http://arxiv.org/abs/2101.07038