The following pages link to (Q4273660):
Displaying 28 items.
- Recognisability for algebras of infinite trees (Q551167) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- An algebraic characterization of frontier testable tree languages (Q672861) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- Grammatical codes of trees (Q1179181) (← links)
- General varieties of tree languages (Q1275067) (← links)
- Properties of grammatical codes of trees (Q1318691) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)
- Tree adjoining languages and multipushdown languages (Q1587367) (← links)
- Querying linguistic trees (Q2268350) (← links)
- The partial clone of linear tree languages (Q2332072) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Characterizing CTL-like logics on finite trees. (Q2490815) (← links)
- Positive varieties of tree languages (Q2576866) (← links)
- A positive extension of Eilenberg's variety theorem for non-regular languages (Q2666961) (← links)
- On the solidity of general varieties of tree languages. (Q2861065) (← links)
- Learning Tree Languages (Q2963598) (← links)
- The theory of configurations in algebraic linguistics (Q3330531) (← links)
- (Q3345794) (← links)
- Recognisable Languages over Monads (Q3451085) (← links)
- Aperiodicity in Tree Automata (Q3522867) (← links)
- Linguistics, Logic and Finite Trees (Q4318160) (← links)
- Algebras for classifying regular tree languages and an application to frontier testability (Q4630273) (← links)
- Idempotent tree languages (Q4916753) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- On reverse and general definite tree languages (Q5204314) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)
