Make the automata deterministic, and possibly minimize them, and then compare them for language equality This proves that the two expressions denote the
rexp
Regular expressions can be seen as a system of notations for denoting ϵ-NFA Another expression for the same language is (01) ∗ 1 union L1 ∪ L2 of two languages L1 and L2 Test if a regular expression denotes the empty language
over
Two expressions with variables are equivalent if whatever languages we The test for whether E = F is true, where E and F are two regular expressions with the
TLComp ProRegLang
8 jan 2015 · (Regular expression ⇒ NFA with ϵ-moves) We will prove, if L is For induction step, let r and s are two regular expressions equivalent to
Lec
How can we prove that two DFAs (or two NFAs) are equivalent? Page 4 MINIMIZING DFAs Page 5 IS THIS
Lecture
We can combine together existing regular expressions in four ways ○ If R 1 and R 2 are regular (R) is a regular expression with the same meaning as R two states remain: q s and q f ○ The Check the appendix to this slide deck
Small