Pages that link to "Item:Q1103732"
From MaRDI portal
The following pages link to Automata accepting primitive words (Q1103732):
Displayed 8 items.
- On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems (Q671421) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- On the language of primitive words (Q1351946) (← links)
- Completing comma-free codes (Q1399997) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Some operations preserving primitivity of words (Q2271430) (← links)
- Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
- Finite Completion of comma-free codes Part 2 (Q4825391) (← links)