You can find a pdf with the thesis in the following way: Find the wikipedia page for Clarence Ellis; On the wikipedia page find the link to his thesis "Probabilistic languages and automata"; Click on this link to find the corresponding archive.org page; Download the thesis at archive.org.


Stefan Kiefer has some work on minimization of probabilistic automata. This should probably put you on the right track: https://arxiv.org/abs/1404.6673.

Only top voted, non community-wiki answers of a minimum length are eligible