Synchronized Shuffle on Backbones

  • Authors:

  • Florin Manea;Victor Mitrana;Daniel-Claudian Voinescu

  • Affiliations:

  • Faculty of Mathematics and Computer Science University of Bucharest Str. Academiei 14, Bucharest, Romania. E-mails: flmanea@funinf.cs.unibuc.ro/ vmi@urv.net/ voinescu.daniel@bcr.ro;Faculty of Mathematics and Computer Science University of Bucharest Str. Academiei 14, Bucharest, Romania. E-mails: flmanea@funinf.cs.unibuc.ro/ vmi@urv.net/ voinescu.daniel@bcr.ro;Faculty of Mathematics and Computer Science University of Bucharest Str. Academiei 14, Bucharest, Romania. E-mails: flmanea@funinf.cs.unibuc.ro/ vmi@urv.net/ voinescu.daniel@bcr.ro

  • Venue:
  • Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we continue the study on synchronized shuffle started in [5] by introducing the condition that the two words which are to be shuffled have to synchronize on a predefined set of backbones. As far as the language-theoretic properties of this operation are concerned, we prove that in a trio the closure under shuffle is equivalent to the closure under synchronized shuffle on a regular set of backbones. Based on this result we show that a set of backbones is regular if and only if the synchronized shuffle of every two regular languages on that set is also regular. Some relationships between this operation and the synchronized shuffle operations introduced in [5] are presented and some open problem are finally discussed.