Continuity of functional transducers: a profinite study of rational functions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2020

Continuity of functional transducers: a profinite study of rational functions

Michaël Cadilhac
Charles Paperman

Résumé

A word-to-word function is continuous for a class of languages V if its inverse maps V-languages to V. This notion provides a basis for an algebraic study of transducers, and was integral to the characterization of the sequential transducers computable in some circuit complexity classes. Here, we report on the decidability of continuity for functional transducers and some standard classes of regular languages. To this end, we develop a robust theory rooted in the standard profinite analysis of regular languages. Since previous algebraic studies of transducers have focused on the sole structure of the underlying input automaton, we also compare the two algebraic approaches. We focus on two questions: When are the automaton structure and the continuity properties related, and when does continuity propagate to superclasses?
Fichier principal
Vignette du fichier
transducer.pdf (669.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03111682 , version 1 (15-01-2021)

Identifiants

Citer

Michaël Cadilhac, Olivier Carton, Charles Paperman. Continuity of functional transducers: a profinite study of rational functions. Logical Methods in Computer Science, 2020, ⟨10.23638/LMCS-16(1:24)2020⟩. ⟨hal-03111682⟩
30 Consultations
69 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More