关于自洗牌语言
On the Self Shuffle Language
摘要:
两个字\(u\)和\(v\)的混洗积\(u\shuffle v\)是可以通过交织\(u\)和\(v\)获得的所有字的集合。受Restivo(2015)的论文\emph{The Shuffle Product: New Research Directions}的启发,我们研究了shuffle乘积的一个特殊情况。在这项工作中,我们认为洗牌的一个字本身称为\emph{self shuffle}或\emph{shuffle square},显示第一,自洗牌语言和洗牌的语言一般是不同的集。我们证明了语言的所有单词出现作为一个自我洗牌的一些字是上下文敏感的,但不是上下文自由的。此外,我们证明了自洗牌\(w \shuffle w\)唯一地确定\(w\)。
英文摘要:
The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shuffle Product: New Research Directions} by Restivo (2015) we investigate a special case of the shuffle product. In this work we consider the shuffle of a word with itself called the \emph{self shuffle} or \emph{shuffle square}, showing first that the self shuffle language and the shuffle of the language are in general different sets. We prove that the language of all words arising as a self shuffle of some word is context sensitive but not context free. Furthermore, we show that the self shuffle \(w \shuffle w\) uniquely determines \(w\).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。