Let T = A ∪ B ∪ C be an alphabet that is partitioned into three subalphabets. The mixing product of a word g over A ∪ B and of a word d over A ∪ C is the set of words w over T such that its projection onto A ∪ B gives g and its projection onto A ∪ C gives d.Let R be a regular language over T such that xbcy is in R if and only if xcby is in R for any two letters b in B and c in C. In other words, R is commutative over B and C. Is this property "structural" in the sense that R can then be obtained as a mixing product of a regular language over A ∪ B and of a regular language over A ∪ C?This question has a rather easy answer, but there are many cases where the answer is negative. A more interesting question is whether R can be represented as a finite union of mixed products of regular languages. For the moment, we do not have an answer to this question. However, we prove that it is decidable whether, for a given k, the language R is a union of at most k mixed products of regular languages.
[1]
Wojciech Zielonka,et al.
The Book of Traces
,
1995
.
[2]
Carol Myers-Scotton,et al.
Endangered languages: A way to dusty death: the Matrix Language turnover hypothesis
,
1998
.
[3]
Wieslaw Zielonka,et al.
Notes on Finite Asynchronous Automata
,
1987,
RAIRO Theor. Informatics Appl..
[4]
Christine Duboc,et al.
Mixed Product and Asynchronous Automata
,
1986,
Theor. Comput. Sci..
[5]
Peter Bakker,et al.
A language of our own : the genesis of Michif, the mixed Cree-French language of the Canadian Métis
,
1999
.