Learn More

- Stepan Holub, Vojtech Matocha
- Kybernetika
- 2013

We analyze the algorithm in [4], which decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(m · n), where n is the length of the word and m the size of the alphabet. A visualization of the algorithm can be found on [7].

- MORPHIC PRIMITIVITY, Štěpán Holub, Vojtěch Matocha
- 2013

We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(m · n), where n is the length of the word and m the size of the alphabet.

- ‹
- 1
- ›