arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.0190cs.FL
收藏

在群语言中包含正则语言和线性语言

Inclusion of regular and linear languages in group languages

Krasimir Yordzhev

摘要:

令$Σ= X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$和令$G$是具有生成元集合$Σ$的群。令$\mathfrak{L} (G) =\left\{ \left. ω\in Σ^* \; \right\vert \;ω\equiv e \; (\textrm{mod} \; G) \right\} \subseteq Σ^*$是表示$G$的群语言,其中$Σ^*$是$Σ$上的自由幺半群,$e$是$G$中的恒等式。本文讨论了上下文无关语言是否是群语言子集的问题。本文提出了一种多项式算法,用于检验一组语言中是否包含正则语言或线性语言。建立几个有限集合,使得当且仅当相应的上下文无关语言被包括在$\mathfrak{L} (G)$中时,它们中的每一个都被包括在组语言$\mathfrak{L} (G)$中。

英文摘要:

Let $Σ= X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $Σ$. Let $\mathfrak{L} (G) =\left\{ \left. ω\in Σ^* \; \right\vert \;ω\equiv e \; (\textrm{mod} \; G) \right\} \subseteq Σ^*$ be the group language representing $G$, where $Σ^*$ is a free monoid over $Σ$ and $e$ is the identity in $G$. The problem of determining whether a context-free language is subset of a group language is discussed. Polynomial algorithms are presented for testing whether a regular language, or a linear language is included in a group language. A few finite sets are built, such that each of them is included in the group language $\mathfrak{L} (G)$ if and only if the respective context-free language is included in $\mathfrak{L} (G)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑