The commutation of finite sets: A challenging problem

DOI10.1016/S0304-3975(00)00434-5zbMath1014.68128MaRDI QIDQ1605327

Juhani Karhumäki, Christian Choffrut, Nicolas Ollinger

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) ⋮ Playing with Conway's problem ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Commutation with codes ⋮ On the complexity of decidable cases of the commutation problem of languages ⋮ A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES ⋮ ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES ⋮ Conjugacy of finite biprefix codes ⋮ On the simplest centralizer of a language ⋮ Regular solutions of language inequalities and well quasi-orders ⋮ On Conjugacy of Languages

Cites Work

• On equations for regular languages, finite automata, and sequential networks
• Commutativity in free inverse monoids
• A defect theorem for bi-infinite words.
• Codes et motifs
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The commutation of finite sets: A challenging problem