Theory of Computing Systems

, Volume 57, Issue 2, pp 287–318

Synchronizing Relations on Words

Article

DOI: 10.1007/s00224-014-9584-2

Cite this article as:
Figueira, D. & Libkin, L. Theory Comput Syst (2015) 57: 287. doi:10.1007/s00224-014-9584-2
  • 118 Downloads

Abstract

While the theory of languages of words is very mature, our understanding of relations on words is still lagging behind. And yet such relations appear in many new applications such as verification of parameterized systems, querying graph-structured data, and information extraction, for instance. Classes of well-behaved relations typically used in such applications are obtained by adapting some of the equivalent definitions of regularity of words for relations, leading to non-equivalent notions of recognizable, regular, and rational relations. The goal of this paper is to propose a systematic way of defining classes of relations on words, of which these three classes are just natural examples, and to demonstrate its advantages compared to some of the standard techniques for studying word relations. The key idea is that of a synchronization of a pair of words, which is a word over an extended alphabet. Using it, we define classes of relations via classes of regular languages over a fixed alphabet, just {1,2} for binary relations. We characterize some of the standard classes of relations on words via finiteness of parameters of synchronization languages, called shift, lag, and shiftlag. We describe these conditions in terms of the structure of cycles of graphs underlying automata, thereby showing their decidability. We show that for these classes there exist canonical synchronization languages, and every class of relations can be effectively re-synchronized using those canonical representatives. We also give sufficient conditions on synchronization languages, defined in terms of injectivity and surjectivity of their Parikh images, that guarantee closure under intersection and complement of the classes of relations they define.

Keywords

Word relations Regular Rational Recognizable 

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.University of EdinburghEdinburghUK

Personalised recommendations