A finite state probabilistic automaton that accepts a context sensitive language that is not context free

It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed