Pages that link to "Item:Q551167"
From MaRDI portal
The following pages link to Recognisability for algebras of infinite trees (Q551167):
Displaying 15 items.
- Regular languages of thin trees (Q290908) (← links)
- An algebraic proof of Rabin's tree theorem (Q1951555) (← links)
- Algebra for trees (Q2074223) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Tree-recognizers and tree-hyperrecognizers (Q2759833) (← links)
- Algebraic templates of \(\omega\)-trees, similarity and templates generated by semantic schemas (Q2893654) (← links)
- Regular languages of thin trees (Q2957916) (← links)
- Algebra for Infinite Forests with an Application to the Temporal Logic EF (Q3184670) (← links)
- (Q3359781) (← links)
- (Q4989401) (← links)
- Congruence-based proofs of the recognizability theorems for free many-sorted algebras (Q5112648) (← links)
- (Q5216308) (← links)
- Regular tree languages in low levels of the Wadge hierarchy (Q5232909) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311161) (← links)