Author:
Badkobeh Golnaz,Ochem Pascal
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Fewest repetitions vs maximal-exponent powers in infinite binary words;Badkobeh;Theoret. Comput. Sci.,2011
2. Growth problems for avoidable words;Baker;Theoret. Comput. Sci.,1989
3. Axel Thue's Papers on Repetitions in Words: A Translation;Berstel,1995
4. An algorithm to test if a given circular HD0L-language avoids a pattern;Cassaigne,1994
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. More Characterizations of Morphic Words;2024
2. On ternary Dejean words avoiding 010;Notes on Number Theory and Discrete Mathematics;2023-07-27
3. Doubled Patterns with Reversal and Square-Free Doubled Patterns;The Electronic Journal of Combinatorics;2023-03-24
4. Avoidability of Palindrome Patterns;The Electronic Journal of Combinatorics;2021-01-15
5. Avoidability of Formulas with Two Variables;Developments in Language Theory;2016