Results 41 to 50 of about 914 (247)
A bialgebraic approach to automata and formal language theory [PDF]
Annals of Pure and Applied Logic, 2008 29 pages, fixed typos, added ...
openaire +2 more sources
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source
Synthesis of Data Word Transducers [PDF]
Logical Methods in Computer Science, 2021 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 infinite
Léo Exibard +2 more
doaj +1 more source
Minimality Notions via Factorization Systems and Examples [PDF]
Logical Methods in Computer Science, 2022 For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system.
Thorsten Wißmann
doaj +1 more source
Determinisability of register and timed automata [PDF]
Logical Methods in Computer Science, 2022 The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente +2 more
doaj +1 more source
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +1 more source
Unifying B\"uchi Complementation Constructions [PDF]
Logical Methods in Computer Science, 2013 Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation.
Seth J. Fogarty +3 more
doaj +1 more source
Logical Methods in Computer Science, 2020 We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj +1 more source
Graph Logics with Rational Relations [PDF]
Logical Methods in Computer Science, 2013 We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications.
Pablo Barcelo +2 more
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source