Does anyone know what the best method is to prove that the intersection of Language1 and Language 2 = Language1?
Where both languages are over alphabet {a,b,c}.
Does anyone know what the best method is to prove that the intersection of Language1 and Language 2 = Language1?
Where both languages are over alphabet {a,b,c}.
Copyright © 2021 JogjaFile Inc.
The problem of equality of two regular expression is EXPSACE-complete. So I guess building the automaton and working on the automaton would be the easier way to solve your problem.