Zobrazeno 1 - 10
of 22
pro vyhledávání: '"EXIBARD, LÉO"'
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
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
In a Church synthesis game, two players, Adam and Eve, alternately pick some element in a finite alphabet, for an infinite number of rounds. The game is won by Eve if the omega-word formed by this infinite interaction belongs to a given language S, c
Externí odkaz:
http://arxiv.org/abs/2004.12141
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 the c
Externí odkaz:
http://arxiv.org/abs/2002.08203
The transducer synthesis problem on finite words asks, given a specification $S \subseteq I \times O$, where $I$ and $O$ are sets of finite words, whether there exists an implementation $f: I \rightarrow O$ which (1) fulfils the specification, i.e.,
Externí odkaz:
http://arxiv.org/abs/1905.03560
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (March 18, 2021) lmcs:5982
In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infi
Externí odkaz:
http://arxiv.org/abs/1905.03538
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alph
Externí odkaz:
http://arxiv.org/abs/1710.00213
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.