2000 character limit reached
The Frobenius problem for the shuffle operation
Published 30 Aug 2016 in cs.FL | (1608.08592v1)
Abstract: We characterize the finite sets S of words such that that the iterated shuffle of S is co-finite and we give some bounds on the length of a longest word not in the iterated shuffle of S.
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.