Lecture12-1_Part27 - Theorem A REX is a decidable language....

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

View Full Document Right Arrow Icon
An additional way to describe Regular Languages is by use of regular expressions. Now we 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 A REX is a decidable language. Regular Expressions are Decidable 27 { } w R w R A REX generating RE an 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