The following pages link to (Q4432976):
Displaying 13 items.
- Using minimal absent words to build phylogeny (Q442159) (← links)
- Automata and differentiable words (Q442244) (← links)
- Forbidden traces and forbidden subtraces (Q465957) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Reactive automata (Q716325) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- Codes, unambiguous automata and sofic systems. (Q2490804) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
- Decision Problems for Convex Languages (Q3618584) (← links)
- Building Phylogeny with Minimal Absent Words (Q5200056) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
