Nominal Automata with Name Deallocation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912982260252672 |
|---|---|
| author | Prucker, Simon Milius, Stefan Schröder, Lutz |
| author_facet | Prucker, Simon Milius, Stefan Schröder, Lutz |
| contents | Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the $λ$-calculus, adhere to properly nested scoping. In contrast, stateful programming languages with explicit memory allocation and deallocation, such as C, commonly interleave the scopes of allocated memory regions. This phenomenon is captured in dedicated formalisms such as dynamic sequences and bracket algebra, which similarly feature explicit allocation and deallocation of letters. One of the classical formalisms for data languages are register automata, which have been shown to be equivalent to automata models over nominal sets. In the present work, we introduce a nominal automaton model for languages of data words with explicit allocation and deallocation that strongly resemble dynamic sequences, extending existing nominal automata models by adding deallocating transitions. Using a finite NFA-type representation of the model, we establish a Kleene theorem that shows equivalence with a natural expression language. Moreover, we show that our non-deterministic model allows for determinization, a quite unusual phenomenon in the realm of nominal and register automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_24468 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Nominal Automata with Name Deallocation Prucker, Simon Milius, Stefan Schröder, Lutz Formal Languages and Automata Theory Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the $λ$-calculus, adhere to properly nested scoping. In contrast, stateful programming languages with explicit memory allocation and deallocation, such as C, commonly interleave the scopes of allocated memory regions. This phenomenon is captured in dedicated formalisms such as dynamic sequences and bracket algebra, which similarly feature explicit allocation and deallocation of letters. One of the classical formalisms for data languages are register automata, which have been shown to be equivalent to automata models over nominal sets. In the present work, we introduce a nominal automaton model for languages of data words with explicit allocation and deallocation that strongly resemble dynamic sequences, extending existing nominal automata models by adding deallocating transitions. Using a finite NFA-type representation of the model, we establish a Kleene theorem that shows equivalence with a natural expression language. Moreover, we show that our non-deterministic model allows for determinization, a quite unusual phenomenon in the realm of nominal and register automata. |
| title | Nominal Automata with Name Deallocation |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2603.24468 |