Deciding Equivalence of Finite Tree Automata
From MaRDI portal
Recommendations
Cited in
(49)- Inequality of finite behaviors of rational weight finite automata is in R
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Minimizing deterministic weighted tree automata
- Equivalence of infinite behavior of finite automata
- On the degree of ambiguity of finite automata
- Synchronized tree automata
- A gap property of deterministic tree languages.
- Attribute grammars for unranked trees as a query language for structured documents
- Sequentiality, monadic second-order logic and tree automata.
- Automata on infinite trees
- Tree automata with equality constraints modulo equational theories
- Third-order Idealized Algol with iteration is decidable
- Analysis of dynamic policies
- Characterizing EF and EX tree logics
- Genetic algorithms in logic tree decision modeling
- Relating word and tree automata
- Regular matching and inclusion on compressed tree patterns with constrained context variables
- Deciding twig-definability of node selecting tree automata
- On finite and polynomial ambiguity of weighted tree automata
- Complexity of equivalence and learning for multiplicity tree automata
- Conjunctive visibly-pushdown path queries
- A fragment of ML decidable by visibly pushdown automata
- The mu-calculus and Model Checking
- Minimizing Deterministic Weighted Tree Automata
- Generating, sampling and counting subclasses of regular tree languages
- Simplifying XML schema: single-type approximations of regular tree languages
- Complexity of E0L structural equivalence
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
- Validating XML document adaptations via hedge automata transformations
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Deciding low levels of tree-automata hierarchy
- Deciding equivalence of finite tree automata
- Complexity of E0L structural equivalence
- Weak inclusion for XML types
- Deciding inclusion of set constants over infinite non-strict data structures
- Unambiguity in automata theory
- On the complexity of typechecking top-down XML transformations
- Choice functions and well-orderings over the infinite binary tree
- Distributed XML design
- Decidability of equivalence for deterministic synchronized tree automata
- On the equivalence of recursive and nonrecursive Datalog programs
- Single-valuedness of tree transducers is decidable in polynomial time
- Another variation on the common subexpression problem
- Nominal tree automata with name allocation
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Definable transductions and weighted logics for texts
- Weighted tree automata and weighted logics
- Automata for XML -- a survey
- On the minimization of XML schemas and tree automata for unranked trees
This page was built for publication: Deciding Equivalence of Finite Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477969)
