Uniformly growing k-th power-free homomorphisms
Reads0
Chats0
TLDR
It is shown that there exist exponentially many square-free and cube-free strings of each length over these alphabets and arguments for the nonexistence of various RT(n)th power-free homomorphisms are provided.About:
This article is published in Theoretical Computer Science.The article was published on 1988-03-01 and is currently open access. It has received 184 citations till now. The article focuses on the topics: Substring & String (computer science).read more
Citations
More filters
Book ChapterDOI
Combinatorics of words
TL;DR: This is a survey on combinatorics of words to appear as a chapter in Handbook of Formal Languages about defect effect, equations as properties of words, periodicity, finiteness conditions, avoidabilty and subword complexity.
Book ChapterDOI
Context-free languages and pushdown automata
TL;DR: This chapter is devoted to context-free languages, which were designed initially to formalize grammatical properties of natural languages and grammars and appeared to be well adapted to the formal description of the syntax of programming languages.
Book ChapterDOI
Context-free languages
Jean Berstel,Luc Boasson +1 more
TL;DR: Two other languages, the Lukasiewicz language and the language of completely parenthesized arithmetic expressions, are studied and a proof of the Chomsky-Schutzenberger Theorem is presented.
Book
Ramsey Theory on the Integers
Bruce Landman,Aaron Robertson +1 more
TL;DR: Van der Waerden's theorem Supersets of $AP$ Subsets of$AP$ Other generalizations of $w(k r)$ Arithmetic progressions (mod $m$) Other variations on van derWaerde's theorem Schur's theorem Rado's theorem Other topics Notation Biobliography Index as discussed by the authors
References
More filters
Book
Introduction to formal language theory
TL;DR: This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
Journal ArticleDOI
The equation $a^M=b^Nc^P$ in a free group.
Journal ArticleDOI
Avoidable patterns in strings of symbols
TL;DR: In this paper, it was shown that every Mh power-free word on n-letters is a subword of a maximal word of the same kind, and that all words of length at least 2 are avoidable.
Book ChapterDOI
Sur les mots sans carré définis par un morphisme
TL;DR: This paper shows that it is decidable whether an infinite word over a three letter alphabet obtained by iterating a morphism is nonrepetitive, and investigates nonrePETitive morphisms, i.e. morphisms preserving nonre petitive words.