关于几乎\(\theta\)-可交换的词
On words that nearly $θ$-commute
AI总结:
研究当两个等长词\(x\)、\(y\)满足\(xy\)与\(\theta(y)x\)的汉明距离为1时的性质,给出此类\(x\)、\(y\)的完整刻画,引入二元关系\(R_\theta\)并讨论相关集合性质。
摘要:
两个等长词\(\alpha\)、\(\beta\)的汉明距离是\(\alpha\)与\(\beta\)不同的位置数。对于\(x,y\in\Sigma^*\)和反态对合\(\theta\),若\(xy\)与\(\theta(y)x\)的汉明距离为零,则\(x\)与\(y\)\(\theta\)-可交换;当汉明距离为1时,称\(x\)几乎\(\theta\)-可交换,本文研究相关性质。
英文摘要:
The Hamming distance between two equal length words $α, β$ is the number of positions where $α$ and $β$ differ. For $x, y \in Σ^*$ and antimorphic involution $θ$, $x$ $θ$-commutes with $y$, if the Hamming distance between $xy$ and $θ(y)x$ is zero. When the Hamming distance between $xy$ and $θ(y)x$ attains its minimum non-zero value of one, then we say $x$ nearly $θ$-commutes with $y$. This manuscript investigates properties of $x$ and $y$ such that the Hamming distance between $xy$ and $θ(y)x$ is one. We provide a complete characterization of such $x$ and $y$. We introduce a binary relation $R_θ$ on $Σ^*$, where $x R_θy$ holds if and only if $x$ nearly $θ$-commutes with $y$. Finally, for a given $y$, we collect all $x$ such that $x$ nearly $θ$-commutes with $y$, and discuss various properties of this set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。