Efficient Construction of Reversible Transducers from Regular Transducer Expressions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Efficient Construction of Reversible Transducers from Regular Transducer Expressions

Paul Gastin
Luc Dartois
  • Fonction : Auteur
  • PersonId : 1049322
  • IdHAL : ldartois
R. Govind
  • Fonction : Auteur
  • PersonId : 1162398

Résumé

The class of regular transformations has several equivalent characterizations such as functional MSO transductions, deterministic two-way transducers, streaming string transducers, as well as regular transducer expressions (RTE). For algorithmic applications, it is very common and useful to transform a specification, here, an RTE, to a machine, here, a transducer. In this paper, we give an efficient construction of a two-way reversible transducer (2RFT) equivalent to a given RTE. 2RFTs are a well behaved class of transducers which are deterministic and co-deterministic (hence allows evaluation in linear time w.r.t. the input word), and where composition has only polynomial complexity. We show that, for full RTE, the constructed 2RFT has size doubly exponential in the size of the expression, while, if the RTE does not use Hadamard product or chained-star, the constructed 2RFT has size exponential in the size of the RTE.
Fichier principal
Vignette du fichier
2202.04340.pdf (1.47 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03772628 , version 1 (08-09-2022)

Identifiants

  • HAL Id : hal-03772628 , version 1

Citer

Paul Gastin, Luc Dartois, R. Govind, Shankara Narayanan Krishna. Efficient Construction of Reversible Transducers from Regular Transducer Expressions. 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’22), Aug 2022, Haifa, Israel. ⟨hal-03772628⟩
46 Consultations
19 Téléchargements

Partager

Gmail Facebook X LinkedIn More