Closure properties of synchronized relations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Closure properties of synchronized relations

Résumé

A standard approach to define k-ary word relations over a finite alphabet A is through k-tape finite state automata that recognize regular languages L over {1,. .. , k} × A, where (i, a) is interpreted as reading letter a from tape i. Accordingly, a word w ∈ L denotes the tuple (u1,...,uk) ∈ (A*)^k in which ui is the projection of w onto i-labelled letters. While this formalism defines the well-studied class of rational relations, enforcing restrictions on the reading regime from the tapes, which we call synchronization, yields various sub-classes of relations. Such synchronization restrictions are imposed through regular properties on the projection of the language L onto {1,..., k}. In this way, for each regular language C ⊆ {1,..., k}*, one obtains a class Rel(C) of relations. Synchronous, Recognizable, and Length-preserving rational relations are all examples of classes that can be defined in this way. We study basic properties of these classes of relations, in terms of closure under intersection, complement, concatenation, Kleene star and projection. We characterize the classes with each closure property. For the binary case (k = 2) this yields effective procedures.
Fichier principal
Vignette du fichier
main.pdf (593.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01884574 , version 1 (01-10-2018)
hal-01884574 , version 2 (23-04-2019)

Identifiants

Citer

María Emilia Descotte, Diego Figueira, Santiago Figueira. Closure properties of synchronized relations. International Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2019, Berlin, Germany. ⟨10.4230/LIPIcs.STACS.2019.22⟩. ⟨hal-01884574v2⟩

Collections

CNRS ANR
204 Consultations
151 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More