Pages that link to "Item:Q5096779"
From MaRDI portal
The following pages link to Equality and disequality constraints on direct subterms in tree automata (Q5096779):
Displaying 27 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- Multitree automata that count (Q1770418) (← links)
- Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Weighted tree automata with constraints (Q2164002) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- (Q5090498) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- Weighted tree automata with constraints (Q6151146) (← links)
