Due: Friday, January 29
Face-to-face students: Submit in class.
Online students: submit a scanned or typed homework by email, as an attachment.
Prove that every finite language is computable.
Let L be the following language.
| L = | {‹M› | M is a finite state machine with alphabet {a,b,c}, M accepts all strings in {a}*, and M rejects all other strings.} |
Show that L is computable.