The following pages link to (Q3086921):
Displayed 18 items.
- Regular languages of thin trees (Q290908) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Recognisability for algebras of infinite trees (Q551167) (← links)
- A syntactic congruence for languages of birooted trees (Q906981) (← links)
- Varieties (Q2074217) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- EF+EX Forest Algebras (Q2947153) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Algebra for Infinite Forests with an Application to the Temporal Logic EF (Q3184670) (← links)
- Recognisable Languages over Monads (Q3451085) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- (Q4989401) (← links)
- (Q5090989) (← links)
- (Q5232909) (← links)
- Weak Separation Problem for Tree Languages (Q5859635) (← links)
- Grammar-based compression of unranked trees (Q5915574) (← links)
- (Q6191006) (← links)