Handbook of formal languages, vol. 1
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Conway's problem for three-word sets
Theoretical Computer Science
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Computation: finite and infinite machines
Computation: finite and infinite machines
The Branching Point Approach to Conway's Problem
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Commutation with Codes and Ternary Sets of Words
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We consider a few problems connected to the commutation of languages, in particular finite ones. The goal is to emphasize the challenging nature of such simply formulated problems. In doing so we give a survey of results achieved during the last few years, restate several open problems and illustrate some approaches to attack such problems by two simple constructions.