Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Toward The Combinatorial Limit Theory Of Free Words, Danny Rorabaugh
Toward The Combinatorial Limit Theory Of Free Words, Danny Rorabaugh
Theses and Dissertations
Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent advances in the combinatorial limit theory of graphs–notably those involving flag algebras, graph homomorphisms, and graphons–we investigate the extremal and asymptotic theory of pattern containment and avoidance in words.
Word V is a factor of word W provided V occurs as consecutive letters within W. W is an instance of V provided there exists a nonerasing monoid homomorphsism phi with …