Complexity of testing morphic primitivity
Formal Languages and Automata Theory
2013-10-04 v1 Combinatorics
Abstract
We analyze the algorithm in [Holub, 2009], 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(mn), where n is the length of the word and m the size of the alphabet.
Keywords
Cite
@article{arxiv.1207.5690,
title = {Complexity of testing morphic primitivity},
author = {Vojtěch Matocha and Štěpán Holub},
journal= {arXiv preprint arXiv:1207.5690},
year = {2013}
}