Lecture12-1_Part31

Lecture12-1_Part31 - DFA Equivalence is Decidable 31 ( ) (...

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

View Full Document Right Arrow Icon
Our survey of decidability problems for regular languages is completed by considering and proving: Theorem EQ DFA is a decidable language.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: DFA Equivalence is Decidable 31 ( ) ( ) { } B L A L B A B A EQ DFA = | = and s-DFA are and ,...
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