Deciding Conjugacy of a Rational Relation
C. Aiswarya, Amaldev Manuel, Saina Sunny
TL;DR
The paper addresses the decidability of whether a rational relation is conjugate, introducing the notion of a common witness as a certificate of conjugacy. It proves that a rational relation is conjugate iff every sumfree component has a common inner or outer witness, generalizing Lyndon–Schützenberger. A PTIME procedure is provided for deciding conjugacy on sumfree expressions, and any rational expression can be reduced to sumfree form with exponential blow-up, yielding overall decidability for conjugacy of rational relations. The key methodological advance is the common-witness framework, together with two common-witness theorems for Kleene-closure and monoid-closure cases, enabling a structured, algorithmic approach to the problem. This work has implications for transducer theory and related decision problems like twinning and subsequentiality, by linking conjugacy to witness-based certificates and reinforcing the decidability landscape for formal-language problems.
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ützenberger 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.