2012/01/05 by Karel Klouda · 18 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithms and Data Compression #Computer science #DNA and Biological Computing #Linguistics #Mathematics #Philosophy #Programming language #math.CO #msc:68R15 #semigroups and automata theory
paper · pdf · doi:10.1016/j.tcs.2012.05.007
published in Theoretical Computer Science 445, 63-74 (Elsevier BV) · 18 pages, 5 figures
arxiv created 2012/01/05 · openalex publication_date 2012/05/09 · arxiv updated 2017/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/08
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent.