[Paper Review] Universal Witnesses for State Complexity of Basic Operations Combined with Reversal

Janusz Brzozowski, David Liu|arXiv (Cornell University)|Jul 2, 2012

semigroups and automata theory8 references4 citations

TL;DR

This paper establishes that the universal witness automaton $\mathcal{U}_n(a,b,c)$ and its variants, including permutational and dialectic forms, achieve tight state complexity bounds for all basic operations—boolean operations, concatenation, star, and reversal—when applied to regular languages. It proves that $3 \cdot 2^{m+n-2}$ is the tight upper bound for the reversal of concatenation $(KL)^R = L^R K^R$, and confirms tightness for all other operations involving reversal through systematic reachability and distinguishability proofs using the universal witness framework.

ABSTRACT

We study the state complexity of boolean operations, concatenation and star with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the previously discovered bounds for union, intersection, concatenation and star of such languages can all be met by the recently introduced universal witnesses and their variants.

Motivation & Objective

• To determine tight upper bounds for the state complexity of basic operations on regular languages when combined with reversal.
• To demonstrate that the universal witness $\mathcal{U}_n(a,b,c)$ and its variants can achieve all known tight bounds for operations involving reversal.
• To unify the witness construction for multiple operations by leveraging permutational equivalence and dialects of the universal witness.
• To simplify and generalize proofs of state complexity bounds by using a single universal witness framework across diverse operations.

Proposed method

• The universal witness $\mathcal{U}_n(a,b,c)$ is used as a canonical DFA with $n$ states, defined over alphabet $\{a,b,c\}$, with specific state transitions and a single final state.
• Permutational equivalence is applied to generate variants like $\mathcal{U}_n(b,a,c)$ and $\mathcal{U}_n(d,c,b,a)$, preserving state complexity properties under letter renaming.
• Dialects of the universal witness, such as $U_{\{0\},n}(a,b,c)$ and $V_n(a,b,c,d)$, are used to model specific operations like star and reversal with different final state sets.
• Reachability of all $2^{n+m-1} + 2^{n+m-2} = 3 \cdot 2^{n+m-2}$ states in the product automaton is proven via inductive construction using input words over $\{b,c,d\}^*$ and $\{a,b,c\}^*$.
• Distinguishability of states is established using $a^k$ and $d^l a^{k+1}$ transformations to separate subsets based on membership in $Q_2$ and $Q_1$.
• The proof framework is extended to operations like $K^R L$, $KL^R$, $K \cup L^R$, $K \cap L^R$, and $(L^*)^R$, using the same witness structure with modified final states.

Experimental results

Research questions

• RQ1 Can the universal witness $\mathcal{U}_n(a,b,c)$ and its variants achieve tight state complexity bounds for all combinations of basic operations and reversal?
• RQ2 Is the upper bound $3 \cdot 2^{m+n-2}$ for $(KL)^R = L^R K^R$ tight, and can it be achieved using the universal witness framework?
• RQ3 Can permutational equivalence and dialects of the universal witness simplify and unify proofs across multiple operations involving reversal?
• RQ4 What is the state complexity of $K^R L$, $KL^R$, and $K \cup L^R$ with respect to the universal witness, and is it tight?
• RQ5 Does the universal witness framework also achieve tight bounds for the reversal of the star operation, $(L^*)^R = (L^R)^*$?

Key findings

• The reversal of concatenation $(KL)^R = L^R K^R$ has a tight state complexity upper bound of $3 \cdot 2^{m+n-2}$, which is achieved by the universal witness $\mathcal{U}_n(a,b,c)$.
• All previously known tight bounds for operations involving reversal—union, intersection, concatenation, star, and their variants—can be met using the universal witness $\mathcal{U}_n(a,b,c)$ and its permutational and dialectic variants.
• The universal witness $\mathcal{U}_n(a,b,c)$ with final state set $\{0\}$ achieves the tight bound of $2^n$ for the reversal of the star operation, $(L^*)^R = (L^R)^*$.
• The product automaton for $K$ and $L^R$ reaches exactly $3 \cdot 2^{m+n-2}$ states, with $2^{n+m-1}$ states not containing $q_0$ and $2^{n+m-2}$ states containing both $q_0$ and $m-1$, all of which are reachable.
• All states in the product automaton are pairwise distinguishable: states with different subsets of $Q_2$ are separated by $a^k$, and states with different subsets of $Q_1$ are separated by $d^l a^{k+1}$ when $Q_2$-components differ.
• The use of dialects and permutational variants of the universal witness allows a unified proof framework that simplifies and generalizes proofs across multiple operations involving reversal.