Residual probabilistic automata are not closed under convex sums
9 Jan 2020
Joshua Moerman
Just a quick counterexample. Letβs fix a finite set $Ξ£$ as our alphabet.
Definition A probabilistic automaton (PA), $A$, consists of a finite state space $Q$; a distribution of initial states $IβD(Q)$; an acceptance function $F:Qβ[0,1]$; and a probabilistic transition function $Ξ΄_{a}:QβD(Q)$ for each $aβΞ£$.
This is roughly the definition of Rabin automata. Via the usual definitions, the semantics of a state is given as $L(q):Ξ£_{β}β[0,1]$. The value $L(q)(w)$ denotes the probability of accepting $w$ starting in state $q$. The language of the automaton, $L(A)$, is then given by the initial states $L(I)$.
Any function $L:Ξ£_{β}β[0,1]$ is called a language. Given a word $w$, we define the derivative language $w_{β1}L$ as
$w_{β1}L(u)=L(wu).$Definition An automaton $A$ is residual if for all states $qβQ$, there is a word $wβΞ£_{β}$ such that $L(q)=w_{β1}L(A)$.
This definition comes from learning theory. There, all information about the automaton has to be inferred from the values $L(A)(w)$ form some words $w$. This is challenging, as nothing is known about the states. Residuality helps: It tells us that $L(q)$ will be observable at some point. (Namely after the word $w$.) It means that we can recover all states if we have enough data. Residual PA can be learned efficiently (in the limit), but we do not have such results for general PA.
The class of languages accepted by a residual PA is a strict subclass of languages accepted by PA. But itβs strictly bigger than the class accepted by deterministic PA. The subclass can be characterised as follows.
Theorem (Denis & Esposito) Given a language $L$, TFAE:

$L$ can be accepted by a residual PA;

There is a finite subset $GβDer(L)$ which generates $Der(L)$ by convex sums.
Here $Der(L)={w_{β1}Lβ£wβΞ£_{β}}$ is the set of all derivatives. (I use a reactive version of PA, whereas Denis and Esposito use a generative model. The differences are inessential.) To get an intuition for the above theorem, compare it to the MyhillNerode theorem. The (proof of the) above theorem also gives a canonical construction.
Closed under convex sums?
Given two languages $L_{1},L_{2}$, we can consider their convex sum $pβL_{1}+(1βp)βL_{2}$. The class of languages accepted by PA is closed under this operation. The usual union construction for NFA does the trick.
What about residual PA? It turns out those languages are not closed under convex sums. Iβll give an example. First, consider the following PA on a oneletter alphabet.
This automaton is not residual. We can make any automaton residual by adding socalled βanchors.β This drastically changes the language (and alphabet), though. By doing this, we get the automaton $A_{1}$ with two letters.
This automaton is residual. Consider the same automaton, but swap $a$ and $b$, call it $A_{2}$. The language $L=21ββL(A_{1})+21ββL(A_{2})$ cannot be accepted by a residual automaton!
To see this, consider the derivatives $L$, $a_{βn}L$, $b_{βn}L$, and $ab_{β1}L$. (Note that $w_{β1}L=ab_{β1}L$ whenever $w$ contains at least one $a$ and one $b$.) The problem is the that $a_{βn}L$ approach a limit, but this limit itself is not a derivative. There is no finite set of derivatives which generate all $a_{βn}L$. So by the theorem, there is no residual PA for this langauge.
I donβt consider this a problem. Closure properties simply do not play an important role in learning theory. For instance, the mustread paper by Denis and Esposito develop the theory of residual PA in depth, providing many results, such as canonical minimal automata, decision procedures, and complexity results. However, they do not even mention closure under convex sums.
Together with Matteo Sammartino, we have some work in progress on residual nominal automata. It mirrors the situation of probabilistic automata closely, with a bit more undecidability sprinkled around. I think itβs a nice topic, and itβs good to understand residuality and its use in learning in different contexts.