Normality and Automata

Autores
Becher, Veronica Andrea; Carton, Olivier; Heiber, Pablo Ariel
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot compress any normal word. We exhaust all combinations of determinism, real-time, and additional memory in the form of counters or stacks, identifying which models can compress normal words. The case of deterministic push-down transducers is the only one still open. We also present results on the preservation of normality by selection with finite automata. Complementing Agafonov's theorem for prefix selection, we show that suffix selection preserves normality. However, there are simple two-sided selection rules that do not.
Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Carton, Olivier. Université Paris Diderot - Paris 7; Francia
Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Finite Automata
Non-Deterministic Automata
Normal Numbers
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/59876
Acceder
id CONICETDig_cc235a47e8afd8f60a92af6aaaddbea2
oai_identifier_str oai:ri.conicet.gov.ar:11336/59876
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Normality and AutomataBecher, Veronica AndreaCarton, OlivierHeiber, Pablo ArielFinite AutomataNon-Deterministic AutomataNormal Numbershttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot compress any normal word. We exhaust all combinations of determinism, real-time, and additional memory in the form of counters or stacks, identifying which models can compress normal words. The case of deterministic push-down transducers is the only one still open. We also present results on the preservation of normality by selection with finite automata. Complementing Agafonov's theorem for prefix selection, we show that suffix selection preserves normality. However, there are simple two-sided selection rules that do not.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Carton, Olivier. Université Paris Diderot - Paris 7; FranciaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaAcademic Press Inc Elsevier Science2015-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/59876Becher, Veronica Andrea; Carton, Olivier; Heiber, Pablo Ariel; Normality and Automata; Academic Press Inc Elsevier Science; Journal of Computer and System Sciences; 81; 8; 12-2015; 1592-16130022-0000CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.jcss.2015.04.007info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S002200001500046Xinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:01:32Zoai:ri.conicet.gov.ar:11336/59876instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:01:32.522CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Normality and Automata
title Normality and Automata
spellingShingle Normality and Automata
Becher, Veronica Andrea
Finite Automata
Non-Deterministic Automata
Normal Numbers
title_short Normality and Automata
title_full Normality and Automata
title_fullStr Normality and Automata
title_full_unstemmed Normality and Automata
title_sort Normality and Automata
dc.creator.none.fl_str_mv Becher, Veronica Andrea
Carton, Olivier
Heiber, Pablo Ariel
author Becher, Veronica Andrea
author_facet Becher, Veronica Andrea
Carton, Olivier
Heiber, Pablo Ariel
author_role author
author2 Carton, Olivier
Heiber, Pablo Ariel
author2_role author
author
dc.subject.none.fl_str_mv Finite Automata
Non-Deterministic Automata
Normal Numbers
topic Finite Automata
Non-Deterministic Automata
Normal Numbers
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot compress any normal word. We exhaust all combinations of determinism, real-time, and additional memory in the form of counters or stacks, identifying which models can compress normal words. The case of deterministic push-down transducers is the only one still open. We also present results on the preservation of normality by selection with finite automata. Complementing Agafonov's theorem for prefix selection, we show that suffix selection preserves normality. However, there are simple two-sided selection rules that do not.
Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Carton, Olivier. Université Paris Diderot - Paris 7; Francia
Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot compress any normal word. We exhaust all combinations of determinism, real-time, and additional memory in the form of counters or stacks, identifying which models can compress normal words. The case of deterministic push-down transducers is the only one still open. We also present results on the preservation of normality by selection with finite automata. Complementing Agafonov's theorem for prefix selection, we show that suffix selection preserves normality. However, there are simple two-sided selection rules that do not.
publishDate 2015
dc.date.none.fl_str_mv 2015-12
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/59876
Becher, Veronica Andrea; Carton, Olivier; Heiber, Pablo Ariel; Normality and Automata; Academic Press Inc Elsevier Science; Journal of Computer and System Sciences; 81; 8; 12-2015; 1592-1613
0022-0000
CONICET Digital
CONICET
url http://hdl.handle.net/11336/59876
identifier_str_mv Becher, Veronica Andrea; Carton, Olivier; Heiber, Pablo Ariel; Normality and Automata; Academic Press Inc Elsevier Science; Journal of Computer and System Sciences; 81; 8; 12-2015; 1592-1613
0022-0000
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jcss.2015.04.007
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S002200001500046X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Academic Press Inc Elsevier Science
publisher.none.fl_str_mv Academic Press Inc Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269702520307712
score 13.13397

Publicaciones similares