A Language-Theoretic Approach to the Heapability of Signed Permutations
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929396621770752 |
|---|---|
| author | Istrate, Gabriel |
| author_facet | Istrate, Gabriel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_14275 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Language-Theoretic Approach to the Heapability of Signed Permutations Istrate, Gabriel Combinatorics Discrete Mathematics Formal Languages and Automata Theory 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. |
| title | A Language-Theoretic Approach to the Heapability of Signed Permutations |
| topic | Combinatorics Discrete Mathematics Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2405.14275 |