Deciding Conjugacy of a Rational Relation

TL;DR

This paper proves that determining whether a rational relation is conjugate is decidable, introduces a new combinatorial condition for conjugacy, and provides a polynomial-time decision procedure for certain cases.

Contribution

It establishes a decidability result for conjugacy of rational relations and introduces a new combinatorial characterization that generalizes classical results.

Findings

Decidability of conjugacy for rational relations.

A polynomial-time condition for conjugacy in sumfree expressions.

Generalization of Lyndon and Schützenberger's conjugacy characterization.

Abstract

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of conjugacy has been central in addressing many important algorithmic questions about rational relations. We address the problem of checking whether a rational relation is conjugate and show that it is decidable. Towards our decision procedure, we establish a new result that is of independent interest to word combinatorics. We identify a necessary and sufficient condition for the set of pairs given by $(a_0,b_0) G_1^* (a_1,b_1) \cdots G_k^*(a_k,b_k), k \geq 0$ to be conjugate, where $G_i$ is a (not necessarily rational) conjugate relation and $a_i, b_i$ are arbitrary words. This is similar to, and a nontrivial generalisation of, a characterisation given by Lyndon and Sch\"utzenberger in 1962 for the conjugacy of a pair of words. Furthermore, our condition can be evaluated in polynomial time, yielding a PTIME procedure for deciding the conjugacy of a rational relation given as a sumfree expression. Since any arbitrary rational expression can be expressed as a sum of sumfree expressions (with an exponential blow-up), decidability of conjugacy of rational relations follows.