Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2404.14245 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916217611091968 |
|---|---|
| author | Dörfler, Julian Ikenmeyer, Christian |
| author_facet | Dörfler, Julian Ikenmeyer, Christian |
| contents | We determine all functional closure properties of finite $\mathbb{N}$-weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determine all univariate closure properties in the promise setting, and all multivariate closure properties under certain assumptions on the promise, in particular we determine all multivariate closure properties where the output vector lies on a monotone algebraic graph variety. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_14245 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata Dörfler, Julian Ikenmeyer, Christian Computational Complexity Formal Languages and Automata Theory 68Q45 F.1.1; F.1.3 We determine all functional closure properties of finite $\mathbb{N}$-weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determine all univariate closure properties in the promise setting, and all multivariate closure properties under certain assumptions on the promise, in particular we determine all multivariate closure properties where the output vector lies on a monotone algebraic graph variety. |
| title | Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata |
| topic | Computational Complexity Formal Languages and Automata Theory 68Q45 F.1.1; F.1.3 |
| url | https://arxiv.org/abs/2404.14245 |