Resynchronizing Classes of Word Relations

Abstract : A natural approach to defining binary word relations over a finite alphabet A is through two-tape finite state automata, which can be seen as regular language L over {1,2}xA, where (i,a) is interpreted as reading letter a from tape i. Thus, a word w of the language L denotes the pair (u_1,u_2) \in A^* \times A^* in which u_i is the projection of w onto i-labelled letters. While this formalism defines the well-studied class of Rational relations (a.k.a. non-deterministic finite state transducers), enforcing restrictions on the reading regime from the tapes, that we call synchronization, yields various sub-classes of relations. Such synchronization restrictions are imposed through regular properties on the projection of the language onto {1,2}. In this way, for each regular language C \subseteq {1,2}^*, one obtains a class Rel(C) of relations, such as the classes of Regular, Recognizable, or length-preserving relations, as well as (infinitely) many other classes. We study the problem of containment for synchronized classes of relations: given C,D \subseteq {1,2}^*, is Rel(C) \subseteq Rel(D)? We show a characterization in terms of C and D which gives a decidability procedure to test for class inclusion. This also yields a procedure to re-synchronize languages from {1,2}xA preserving the denoted relation whenever the inclusion holds.
Type de document :
Communication dans un congrès
International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. 2018, 〈https://iuuk.mff.cuni.cz/~icalp2018/〉. 〈10.4230/LIPIcs.ICALP.2018.381〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01721046
Contributeur : Diego Figueira <>
Soumis le : jeudi 26 avril 2018 - 15:38:42
Dernière modification le : mardi 12 juin 2018 - 15:33:07

Fichier

main-hal.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

María Emilia Descotte, Diego Figueira, Gabriele Puppis. Resynchronizing Classes of Word Relations. International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. 2018, 〈https://iuuk.mff.cuni.cz/~icalp2018/〉. 〈10.4230/LIPIcs.ICALP.2018.381〉. 〈hal-01721046v2〉

Partager

Métriques

Consultations de la notice

23

Téléchargements de fichiers

9