Results 51 to 60 of about 1,587 (262)
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
Dependency Tree Automata [PDF]
, 2009 We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true ...
openaire +2 more sources
Composed Bisimulation for Tree Automata [PDF]
International Journal of Foundations of Computer Science, 2008 We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata (TA) using suitable, language-preserving equivalences on the states of the automata. In particular, we propose the so-called composed bisimulation equivalence as a new language preserving equivalence.
Parosh Aziz Abdulla +4 more
openaire +2 more sources
FEBS Open Bio, EarlyView.The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti +5 more
wiley +1 more source
Ultimate TreeAutomizer (CHC-COMP Tool Description) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive properties in terms of expressiveness and accessibility to algorithmic ...
Daniel Dietsch +4 more
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Test derivation based on tree FSMs and tree automata
Труды Института системного программирования РАН, 2018 In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description.
Maria Forostyanova
doaj +1 more source
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective [PDF]
Logical Methods in Computer Science, 2017 Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion.
Natsuki Urabe, Ichiro Hasuo
doaj +1 more source
Randomization in Automata on Infinite Trees [PDF]
ACM Transactions on Computational Logic, 2014 We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions of the automaton.
Carayol, Arnaud +2 more
openaire +3 more sources
Arthritis Care &Research, Accepted Article.Interstitial lung disease (IRD‐ILD) is a significant cause of morbidity and mortality in patients with inflammatory rheumatic disorders (IRD). High‐resolution computed tomography (HRCT) is widely considered the gold standard for the non‐invasive assessment of ILD; however, its interpretation is constrained by substantial inter‐observer variability and ...
Alexander Pfeil +7 more
wiley +1 more source