Results 31 to 40 of about 1,641 (261)
Determinization and Minimization of Automata for Nested Words Revisited
We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (NREs) from the usual XPath benchmark to nested word automata (NWAs).
Joachim Niehren, Momar Sakho
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karel Culík II, Sheng Yu 0001
openaire +1 more source
Random Generation of Nondeterministic Finite-State Tree Automata [PDF]
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
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes.
openaire +3 more sources
Weighted Tree Automata with Constraints
AbstractThe HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages.
Andreas Maletti, Andreea-Teodora Nász
openaire +6 more sources
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms [PDF]
An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms.
Naoki Nishida +2 more
doaj +1 more source
Propositional Tree Automata [PDF]
In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a sufficient completeness checker for specifications with rewriting modulo an equational theory ...
Hendrix, Joe +2 more
openaire +1 more source
TREE AUTOMATA WITH GLOBAL CONSTRAINTS [PDF]
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
On a representation of tree automata
All algebras (or tree automata) considered in this paper are finite with a finite number of operations of some fixed arity. In the usual Gluskov- type general product of algebras there is a feedback function which selects for each component algebra the operation to be performed next.
Zoltán Ésik, Ferenc Gécseg
openaire +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
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

