Pages that link to "Item:Q553317"
From MaRDI portal
The following pages link to Rigid tree automata and applications (Q553317):
Displaying 9 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Tree Automata, (Dis-)Equality Constraints and Term Rewriting (Q3007653) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- (Q5090498) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
