Recommendations
Cited in
(12)- Some operations preserving primitivity of words
- Finite Completion of comma-free codes Part 2
- On the language of primitive words
- Primitive and irreducible automata
- Shortest repetition-free words accepted by automata
- Completing comma-free codes
- Detecting palindromes, patterns and borders in regular languages
- From decidability to undecidability by considering regular sets of instances
- Automaticity of primitive words and irreducible polynomials
- Finite Automata, Palindromes, Powers, and Patterns
- On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems
- Primitive sets of words
This page was built for publication: Automata accepting primitive words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103732)