Attributed Tree Transducers for Partial Functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929380928782336 |
|---|---|
| author | Maneth, Sebastian Vu, Martin |
| author_facet | Maneth, Sebastian Vu, Martin |
| contents | Attributed tree transducers (atts) have been equipped with regular look-around (i.e., a preprocessing via an attributed relabeling) in order to obtain a more robust class of translations. Here we give further evidence of this robustness: we show that if the class of translations realized by nondeterministic atts with regular look-around is restricted to partial functions, then we obtain exactly the class of translations realized by deterministic atts with regular look-around. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_06141 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Attributed Tree Transducers for Partial Functions Maneth, Sebastian Vu, Martin Formal Languages and Automata Theory Attributed tree transducers (atts) have been equipped with regular look-around (i.e., a preprocessing via an attributed relabeling) in order to obtain a more robust class of translations. Here we give further evidence of this robustness: we show that if the class of translations realized by nondeterministic atts with regular look-around is restricted to partial functions, then we obtain exactly the class of translations realized by deterministic atts with regular look-around. |
| title | Attributed Tree Transducers for Partial Functions |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2406.06141 |