=+18. Show that if Ll and L2 are regular languages over X and S is the set
Question:
=+18. Show that if Ll and L2 are regular languages over X and S is the set of all strings over X, then each of S\L1, Ll U L2 , L+, and LIL2 is a regular language.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Fuzzy Automata And Languages Theory And Applications
ISBN: 978-0367396275
1st Edition
Authors: John N Mordeson ,Davender S Malik
Question Posted: