CS 4510 Lecture Notes - Lecture 5: Lmfao, Kalmar Union, Qi
Document Summary
Lecture to ur ddeeffinning equivalence of aahuttoommaattaa if it automata m , , mz are equivalent if they recognize the same language. Umd= um , ) we will prove theorem : for every nea n there is an equivalent dfa . corollary : nfa accepts only regular languages . In many cases , nfa ane al hipher & amaker. We have n we"ll construct an equivalent m . H we showed regular languages are closed under union . by building a dfa that accepts a union king . (cid:8869) we also showed regular languages are closed under the complement of themselves . (cid:8869) A - b = an b- (cid:8869) anb = atb (cid:8869) Ms how do we construct an nfa that # 901. Ma u mz? initial state w/ add new. L e c t u r e f i v e sear a n main theorem :
