Lecture12-1_Part16 - is a decidable language. Finite...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Consider the language Note that once again we formulate a computational problem as a membership problem. Theorem A DFA
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is a decidable language. Finite Automatons are Decidable 16 { } w B w B A DFA accepting a DFA is , | =...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online