Results 11 to 20 of about 7,725 (204)
Flexible RNA design under structure and sequence constraints using formal languages [PDF]
, 2013 The problem of RNA secondary structure design (also called inverse folding) is the following: given a target secondary structure, one aims to create a sequence that folds into, or is compatible with, a given structure.
Denise, Alain +5 more
core +5 more sources
Near-Optimal Scheduling for LTL with Future Discounting [PDF]
, 2015 We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only ...
G Rahonis +13 more
core +1 more source
Containment and equivalence of weighted automata: Probabilistic and max-plus cases [PDF]
, 2020 This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps ...
A Bertoni +26 more
core +2 more sources
Streaming Property Testing of Visibly Pushdown Languages [PDF]
, 2015 In the context of language recognition, we demonstrate the superiority of streaming property testers against streaming algorithms and property testers, when they are not combined. Initiated by Feigenbaum et al., a streaming property tester is a streaming
de Rougemont, Michel +3 more
core +5 more sources
Learning probability distributions generated by finite-state machines [PDF]
, 2016 We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference in the limit and PAC formal models. The methods
Castro Rabal, Jorge +1 more
core +2 more sources
Generalizing input-driven languages: theoretical and practical benefits [PDF]
, 2017 Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields.
Mandrioli, Dino, Pradella, Matteo
core +2 more sources
Weak MSO+U with Path Quantifiers over Infinite Trees
, 2014 This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths.
M. Bojańczyk +10 more
core +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
, 2007 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Helmut Seidl +3 more
core +9 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Glioma recurrence severely impacts patient prognosis, with current treatments showing limited efficacy. Traditional methods struggle to analyze recurrence mechanisms due to challenges in assessing tumor heterogeneity, spatial dynamics, and gene networks.
Lei Qiu +10 more
wiley +1 more source