Two Undecidability Results in Probabilistic Automata Theory

Thumbnail Image
Download
Name

MIT-LCS-TM-285.pdf

Size

2.17 MB

Format

Adobe PDF

Checksum (MD5)

ec717e5c1269dd5c1816229c62a94196

Author(s)
Kilian, Joseph J.
Advisor(s)
Meyer, Albert R.
Date Issued
June 1985
Series/Report no.
MIT-LCS-TM-285
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.