Pages that link to "Item:Q1325850"
From MaRDI portal
The following pages link to Modulo-counting quantifiers over finite trees (Q1325850):
Displaying 8 items.
- Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Algebra for trees (Q2074223) (← links)
- Aperiodicity in Tree Automata (Q3522867) (← links)
- Games for Temporal Logics on Trees (Q3602814) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- (Q5136301) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)
