The following pages link to A Combinatorial Theorem for Trees (Q5428868):
Displaying 11 items.
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- (Q3305348) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- The Height of Factorization Forests (Q3599148) (← links)
- Factorization Forests (Q3637210) (← links)
- (Q5091268) (← links)
