Pages that link to "Item:Q1215275"
From MaRDI portal
The following pages link to A limit theorem for set of subwords in deterministic TOL laguages (Q1215275):
Displaying 9 items.
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- EOL systems with control devices (Q1214263) (← links)
- Subword complexities of various classes of deterministic developmental languages without interactions (Q1221635) (← links)
- On the number of subwords of everywhere growing DTOL languages (Q1228209) (← links)
- Classes of formal grammars (Q1248342) (← links)
- On generalized DT0L systems and their fixed points (Q1342236) (← links)
- Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422) (← links)
- (Q3959451) (← links)
- Subword complexities of various classes of deterministic developmental languages with interactions (Q4066603) (← links)
