Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

Complexity of testing morphic primitivity

Štěpán Holub; Vojtěch Matocha — 2013

Kybernetika

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 $𝒪 (m \cdot n)$ , where $n$ is the length of the word and $m$ the size of the alphabet.

Page 1

Download Results (CSV)