Shuffle factorization is unique
type: Item
instance of: scholarly article
title: Shuffle factorization is unique
zbMATH Open document ID: 0997.68092
DOI: 10.1016/S0304-3975(00)00433-3
author: Jean Berstel
author: Luc Boasson
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1768195
zbMATH Keywords: shuffle
MaRDI profile type: Publication
cites work: Q3659988
cites work: A constant time string shuffle algorithm on reconfigurable meshes
cites work: A natural ring basis for the shuffle algebra and an application to group schemes
cites work: Q3134850
cites work: Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
full work available at URL: s0304-3975(00)00433-3
OpenAlex ID: W2008734340
Recommended article: More efficient shuffle argument from unique factorization
Recommended article: Q3508384
Recommended article: Q4737906
Recommended article: A proof of the shuffle conjecture
Recommended article: The shuffle conjecture
Recommended article: The unique prime factorization
Recommended article: Q4855747
Recommended article: The shuffle algebra on the factors of a word is free
Recommended article: Walks around unique factorization
Recommended article: Q4783736
description: scientific article; zbMATH DE number 1768195