arXiv Open Access 2016

The Frobenius problem for the shuffle operation

Jeremy Nicholson Narad Rampersad

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL

Penulis (2)

Jeremy Nicholson

Narad Rampersad

Format Sitasi

APA MLA BibTeX

Nicholson, J., Rampersad, N. (2016). The Frobenius problem for the shuffle operation. https://arxiv.org/abs/1608.08592

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓