The Frobenius problem for the shuffle operation
Formal Languages and Automata Theory
2016-08-31 v1
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.
Cite
@article{arxiv.1608.08592,
title = {The Frobenius problem for the shuffle operation},
author = {Jeremy Nicholson and Narad Rampersad},
journal= {arXiv preprint arXiv:1608.08592},
year = {2016}
}
Comments
16 pages