2000 character limit reached
On scattered subword complexity
Published 22 Apr 2011 in cs.DM | (1104.4425v1)
Abstract: Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.