Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.creator | Becher, Veronica Andrea | - |
| dc.creator | Carton, Olivier | - |
| dc.creator | Heiber, Pablo Ariel | - |
| dc.date | 2018-09-18T18:41:39Z | - |
| dc.date | 2018-09-18T18:41:39Z | - |
| dc.date | 2018-10 | - |
| dc.date | 2018-09-17T19:37:52Z | - |
| dc.date.accessioned | 2019-04-29T15:43:04Z | - |
| dc.date.available | 2019-04-29T15:43:04Z | - |
| dc.date.issued | 2018-10 | - |
| dc.identifier | Becher, Veronica Andrea; Carton, Olivier; Heiber, Pablo Ariel; Finite-State Independence; Springer; Theory Of Computing Systems; 62; 7; 10-2018; 1555-1572 | - |
| dc.identifier | 1432-4350 | - |
| dc.identifier | http://hdl.handle.net/11336/60112 | - |
| dc.identifier | CONICET Digital | - |
| dc.identifier | CONICET | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/300243 | - |
| dc.description | In this work we introduce a notion of independence based on finite-state automata: two infinite words are independent if no one helps to compress the other using one-to-one finite-state transducers with auxiliary input. We prove that, as expected, the set of independent pairs of infinite words has Lebesgue measure 1. We show that the join of two independent normal words is normal. However, the independence of two normal words is not guaranteed if we just require that their join is normal. To prove this we construct a normal word x1x2x3… where x2n = xn for every n. This construction has its own interest. | - |
| dc.description | Fil: Becher, Veronica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | - |
| dc.description | Fil: Carton, Olivier. Université Paris Diderot - Paris 7; Francia | - |
| dc.description | Fil: Heiber, Pablo Ariel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Springer | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1007/s00224-017-9821-6 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00224-017-9821-6 | - |
| dc.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | - |
| dc.source | reponame:CONICET Digital (CONICET) | - |
| dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
| dc.source | instacron:CONICET | - |
| dc.subject | FINITE-STATE AUTOMATA | - |
| dc.subject | INDEPENDENCE | - |
| dc.subject | INFINITE SEQUENCES | - |
| dc.subject | NORMAL SEQUENCES | - |
| dc.subject | Ciencias de la Computación | - |
| dc.subject | Ciencias de la Computación e Información | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | Finite-State Independence | - |
| dc.type | info:eu-repo/semantics/article | - |
| dc.type | info:eu-repo/semantics/publishedVersion | - |
| dc.type | info:ar-repo/semantics/articulo | - |
| Aparece en las colecciones: | CONICET | |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.