Results 41 to 50 of about 1,576 (262)
Bimorphisms and synchronous grammars
Journal of Language Modelling, 2014 We tend to think of the study of language as proceeding by characterizing the strings and structures of a language, and we think of natural language processing as using those structures to build systems of utility in manipulating the language.
Stuart M. Shieber
doaj +1 more source
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
Logical Methods in Computer Science, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +1 more source
On the Expressive Power of Higher-Order Pushdown Systems [PDF]
Logical Methods in Computer Science, 2020 We show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higher-order pushdown automaton (without collapse) of any order.
Paweł Parys
doaj +1 more source
TREE AUTOMATA WITH GLOBAL CONSTRAINTS [PDF]
International Journal of Foundations of Computer Science, 2008 We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, they are equipped with an equality relation and a disequality relation on states, so that whenever two subtrees t and t′ evaluate (in an accepting run) to two states which ...
Emmanuel Filiot +2 more
openaire +6 more sources
Random Generation of Nondeterministic Finite-State Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable.
Thomas Hanneforth +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
On the power of tree-walking automata [PDF]
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Neven, Thomas Schwentick
openaire +2 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Logics for Unranked Trees: An Overview [PDF]
Logical Methods in Computer Science, 2006 Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing ...
Leonid Libkin
doaj +1 more source
Tree Automata and Tree Grammars
CoRR, 2015 Lecture notes on tree language theory, in particular recognizable tree languages and finite state tree transformations.
openaire +2 more sources