The commutation of finite sets: A challenging problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 940705
- scientific article; zbMATH DE number 2020316
- scientific article; zbMATH DE number 3395901
- Variations of a combinatorial problem on finite sets
- scientific article; zbMATH DE number 3165545
- Commuting pairs of functions on a finite set
- Combinatorial problems in finite fields and Sidon sets
- scientific article; zbMATH DE number 3475547
- A noncommutative enumeration problem
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 4077461 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1222603 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A defect theorem for bi-infinite words.
- Codes et motifs
- Commutativity in free inverse monoids
- On equations for regular languages, finite automata, and sequential networks
- Uniqueness Theorems for Periodic Functions
Cited in
(15)- On the simplest centralizer of a language
- A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
- On the complexity of decidable cases of the commutation problem of languages
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Conjugacy of finite biprefix codes
- Commutation with ternary sets of words
- Commutation with codes
- On a conjecture about commuting codes
- scientific article; zbMATH DE number 1522559 (Why is no real title available?)
- ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES
- Playing with Conway's problem
- Regular solutions of language inequalities and well quasi-orders
- On Conjugacy of Languages
- STACS 2005
This page was built for publication: The commutation of finite sets: A challenging problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605327)
