9 votes

Introduction to probabilistic automata

The first paper by Rabin (1963) gives the basics what you are looking for. The class of languages recognized by probabilistic automata (with cutpoint) is called stochastic languages. Let $P$ be a ...
Abuzer Yakaryilmaz's user avatar
7 votes

How can I find the PhD thesis of C.A. Ellis?

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";...
Gamow's user avatar
  • 5,772
2 votes

Epsilon-closure and DFA minimization algorithms for probabilistic NFA

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.
Shaull's user avatar
  • 5,571
1 vote

Palindrome language and Finite Automata Machines

Regarding probabilistic (and quantum) automata, you may start by digging this survey: https://arxiv.org/abs/1507.01988 For very recent results on quantum automata, you may check two recent works by ...
Abuzer Yakaryilmaz's user avatar

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