We investigate a signed version of the Hammersley process, a discrete process on words related to a property of integer sequences called heapability (Byers et al., ANALCO 2011). The specific version that we investigate corresponds to a version of this property for signed sequences. We give a characterization of the words that can appear as images the signed Hammersley process. In particular we show that the language of such words is the intersection of two deterministic one-counter languages.

翻译：我们研究了Hammersley过程的一个符号版本，这是一个与整数序列的可堆叠性（Byers等人，ANALCO 2011）相关的离散词过程。我们研究的特定版本对应于符号序列该性质的一个变体。我们给出了可作为符号Hammersley过程映像的词的表征。特别地，我们证明了这类词的语言是两个确定性单计数器语言的交集。