Two Undecidability Results in Probabilistic Automata Theory
| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Kilian, Joseph J. | en_US |
| dc.date.accessioned | 2023-03-29T14:26:49Z | |
| dc.date.available | 2023-03-29T14:26:49Z | |
| dc.date.issued | 1985-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149094 | |
| dc.description.abstract | The language accepted by a probabilistic finite state acceptor with an isolated cutpoint is known to be regular. We show that determining if a cutpoint is isolated is undecideable. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-285 | |
| dc.title | Two Undecidability Results in Probabilistic Automata Theory | en_US |
