Skip to main content
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,782
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:
Shaull's user avatar
  • 5,656
1 vote

Palindrome language and Finite Automata Machines

Regarding probabilistic (and quantum) automata, you may start by digging this survey: 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