On the growth rates of complexity of threshold languages
Arseny M. Shur; Irina A. Gorbunova
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 44, Issue: 1, page 175-192
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- F.-J. Brandenburg, Uniformly growing k-th power free homomorphisms. Theoret. Comput. Sci.23 (1983) 69–82.
- A. Carpi, On Dejean's conjecture over large alphabets. Theoret. Comput. Sci.385 (2007) 137–151.
- C. Choffrut, J. Karhumäki, Combinatorics of words, edited by G. Rosenberg and A. Salomaa. Handbook of formal languages, Vol. 1, Chap. 6. Springer, Berlin (1997) 329–438.
- M. Crochemore, F. Mignosi and A. Restivo, Automata and forbidden words. Inform. Process. Lett.67 (1998) 111–117.
- J.D. Currie, N. Rampersad, Dejean's conjecture holds for n ≥ 27. RAIRO-Theor. Inf. Appl.43 (2009) 775–778.
- J.D. Currie, N. Rampersad, A proof of Dejean's conjecture, URIhttp://arxiv.org/PS_cache/arxiv/pdf/0905/0905.1129v3.pdf
- F. Dejean, Sur un Theoreme de Thue. J. Combin. Theory Ser. A13 (1972) 90–99.
- A. Ehrenfeucht and G. Rozenberg, On subword complexities of homomorphic images of languages. RAIRO Inform. Theor.16 (1982) 303–316.
- M. Lothaire, Combinatorics on words. Addison-Wesley (1983).
- M. Mohammad-Noori and J.D. Currie, Dejean's conjecture and Sturmian words. Eur. J. Combin.28 (2007) 876–890.
- J. Moulin-Ollagnier, Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters. Theoret. Comput. Sci.95 (1992) 187–205.
- J.-J. Pansiot, À propos d'une conjecture de F. Dejean sur les répétitions dans les mots. Discrete Appl. Math.7 (1984) 297–311.
- M. Rao, Last Cases of Dejean's Conjecture, accepted to WORDS'2009.
- A.M. Shur, Rational approximations of polynomial factorial languages. Int. J. Found. Comput. Sci.18 (2007) 655–665.
- A.M. Shur, Combinatorial complexity of regular languages, Proceedings of CSR'2008. Lect. Notes Comput. Sci.5010 (2008) 289–301.
- A.M. Shur, Growth rates of complexity of power-free languages. Submitted to Theoret. Comput. Sci. (2008).
- A.M. Shur, Comparing complexity functions of a language and its extendable part. RAIRO-Theor. Inf. Appl.42 (2008) 647–655.
- A. Thue, Über unendliche Zeichenreihen, Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christiana7 (1906) 1–22.