The commutation of finite sets: A challenging problem
type: Item
instance of: scholarly article
title: The commutation of finite sets: A challenging problem
zbMATH Open document ID: 1014.68128
DOI: 10.1016/S0304-3975(00)00434-5
author: Christian Choffrut
author: Juhani Karhumäki
author: Nicolas Ollinger
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1768196
MaRDI profile type: Publication
cites work: Q4430300
cites work: On equations for regular languages, finite automata, and sequential networks
cites work: Commutativity in free inverse monoids
cites work: Q4714446
cites work: Q3808246
cites work: Q5639639
cites work: Q4079524
cites work: Uniqueness Theorems for Periodic Functions
cites work: Q3254327
cites work: Q4218145
cites work: A defect theorem for bi-infinite words.
cites work: Q3659988
cites work: Codes et motifs
cites work: Q3948608
Recommended article: Q4714215
Recommended article: Q4440997
Recommended article: Q5663869
Recommended article: Variations of a combinatorial problem on finite sets
Recommended article: Q3283902
Recommended article: Q2937538
Recommended article: Combinatorial problems in finite fields and Sidon sets
Recommended article: Q4058736
Recommended article: A noncommutative enumeration problem
description: scientific article; zbMATH DE number 1768196