The commutation of finite sets: A challenging problem
From MaRDI portal
Publication:1605327
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)
68R15: Combinatorics on words
Related Items
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES, On the complexity of decidable cases of the commutation problem of languages, Conjugacy of finite biprefix codes, 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, Regular solutions of language inequalities and well quasi-orders, On Conjugacy of Languages, On the simplest centralizer of a language, ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS 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