Cargando…
On Computability of Data Word Functions Defined by Transducers
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data [Formula: see text] -words). The notion of computability is defined through Turing machines with infinite inputs which can produce the corresponding infinite outputs in th...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788621/ http://dx.doi.org/10.1007/978-3-030-45231-5_12 |