Results 51 to 60 of about 6,380 (117)

On the Complexity of ATL and ATL* Module Checking

open access: yes, 2017
Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment.
Bozzelli, Laura, Murano, Aniello
core   +1 more source

Nested Antichains for WS1S

open access: yes, 2015
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented, e ...
Fiedor, Tomas   +3 more
core   +1 more source

Advances and applications of automata on words and trees : abstracts collection [PDF]

open access: yes, 2011
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 "Advances and Applications of Automata on Words and Trees" was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several participants presented their current research,
Glaßer, Christian   +4 more
core  

mlf-core: a framework for deterministic machine learning. [PDF]

open access: yesBioinformatics, 2023
Heumos L   +7 more
europepmc   +1 more source

Non-Malleable Code in the Split-State Model. [PDF]

open access: yesEntropy (Basel), 2022
Aggarwal D, Ball M, Obremski M.
europepmc   +1 more source

MSO definable string transductions and two-way finite state transducers

open access: yes, 1998
String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers.
Engelfriet, Joost   +1 more
core   +1 more source

Multiple sequence alignment based on deep reinforcement learning with self-attention and positional encoding. [PDF]

open access: yesBioinformatics, 2023
Liu Y   +6 more
europepmc   +1 more source

Redundancy in distributed proofs. [PDF]

open access: yesDistrib Comput, 2021
Feuilloley L   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy