Question: Given L1= { (a^n) b :n 0} over = {a, b}, L2= L1(L1 {}) // Properties of concatenation: L(L1L2) = LL1LL2 =L1 L1 U L1
Given L1= { (a^n) b :n 0} over = {a, b},
L2= L1(L1 {}) // Properties of concatenation: L(L1L2) = LL1LL2
=L1 L1 U L1 {} // {} L = L {} = L
write formal language L2 and Design an NFA with no more than3 states to accept L2
and I dont think L2 accept the ,
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
