Lecture12-1_Part29 - Theorem E DFA is a decidable language....

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

View Full Document Right Arrow Icon
In this problem it is required to compute whether a given DFA accepts at least one string: Consider the language and prove:
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Theorem E DFA is a decidable language. The Emptiness Problem for DFA-s 29 ( ) { } φ = | = A L A A E DFA and 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