Explicit test sets for iterated morphisms in free monoids and metabelian groups

  • Authors:

  • Keijo Ruohonen

  • Affiliations:

  • Institute of Mathematics, Tampere University of Technology, 33101 Tampere, Finland

  • Venue:
  • Theoretical Computer Science - Insightful theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

For checking equivalence of any two word morphisms, restricted on a subset (language), it suffices to do this for a finite subset of the language, the so-called finite test set. A way of effectively obtaining a finite test set for a special class of languages, the so-called iterated morphisms, is presented here together with an explicit upper bound for its size. The method can be extended to free metabelian groups, and to certain other metabelian groups.