Pages that link to "Item:Q3590924"
From MaRDI portal
The following pages link to A First Investigation of Sturmian Trees (Q3590924):
Displaying 6 items.
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- A congruence-based perspective on automata minimization algorithms (Q5092441) (← links)
- Subword complexity and Sturmian colorings of regular trees (Q5245330) (← links)
- Substreetutions and more on trees (Q6624550) (← links)
