In a typical regex crossword puzzle, one is given two non-empty lists $〈R_1,\dots ,R_m〉$ and $〈C_1,\dots ,C_n〉$ of regular expressions (regexes) over some alphabet, and the challenge is to fill in an $m\times n$ grid of characters such that the string formed by the $i^{\text{th}}$ row is in $L(R_i)$ and the string formed by the $j^{\text{th}}$ column is in $L(C_j)$, for all $1\le i\le m$ and $1\le j\le n$. We consider a restriction of this puzzle where all the $R_i$ are equal to one another and similarly the $C_j$. We consider a 2-player version of this puzzle, showing it to be PSPACE-complete. Using a reduction from $\mathsf{3SAT}$, we also give a new, simple proof of the known result that the existence problem of a solution for the restricted (1-player) puzzle is NP-complete. We also prove NP-completeness where all the row and column regular expressions are equal to each other.

在一个典型的正则表达式的纵横字谜，给出一个两个非空列表 $〈{\mathrm{电阻}}_1,\dots ,{\mathrm{电阻}}_{米}〉$ 和 $〈C_1,\dots ,C_n〉$ 正则表达式（正则表达式）过字母表一些，而挑战是填补了 $米\times n$ 使得串所形成的字符格 ${\mathrm{一世}}^{\text{日}}$ 排在 $升({\mathrm{电阻}}_{\mathrm{一世}})$ 和字符串由形成 $j^{\text{日}}$ 列是 $升(C_j)$， 对所有人 $1\le \mathrm{一世}\le 米$ 和 $1\le j\le n$. 我们认为这一难题的限制，所有的${\mathrm{电阻}}_{\mathrm{一世}}$ 彼此相等，并且类似地 $C_j$. 我们认为这个难题的2播放器版本，显示出它是PSPACE -complete。使用减少$\mathsf{3SAT}$，我们也给已知结果的一个新的，简单的证明，为限制（1人）谜题的解决方案存在的问题是NP -complete。我们也证明了NP -completeness，所有的行和列的正则表达式彼此相等。