Lecture12-1_Part23 - 23 { } w B w B A NFA accepting NFA a...

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

View Full Document Right Arrow Icon
Now we turn to consider the language and prove: Theorem A NFA is a decidable language. Finite Automatons are Decidable
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 23 { } w B w B A NFA accepting NFA a 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