For L1 = {a, bb,c} and L2 = {ac,ca}, calculate L1L2 , L1∪L2, and L13. L1L2 = {aac,aca,bbac,bbca,cac,cca} L1∪L2 = {a, bb,c, ac, ca} L1^3 = {aaa, aabb, aac, abba, abbbb, abbc, aca, acbb, acc, bbaa, bbabb, bbac, bbbba, bbbbbb, bbbbc, bbca, bbcbb, bbcc, caa, cabb, cac, cbba, cbbbb, cbbc, cca, ccbb, ccc}
For L1 = {a, bb,c} and L2 = {ac,ca}, calculate L1L2 , L1 ∪L2, and L13.
2. If L1 and L2 are regular languages, which of the following are regular languages? Provide justification for your answers. a. L1 U L2 b. L1L2 c. L1 n L2
Automata, Languages and Computation
Using the languages L1 = { (10)* 1(1+0) + (10)*} and L2 = { a(a*) }, construct an ei NFA that accepts the concatenation of the languages L1L2.
Using the languages L1 = { (10)* 1(1+0) + (10)*} and L2 = { a(a*) }, construct an ei NFA that accepts the concatenation of the languages L1L2.
For Language L1 and L2 prove or disprove (L1 union L2)*=L1* intersection L2*
a.) Exhibit an algorithm that, given any three regular languages, L,L1,L2, determines whether or not L = L1L2. b.) Describe an algorithm by which one can decide whether two regular expressions are equivalent.
L1 and L2 are lists. L3 = L1 + L2 This is an example of mutation of L is this true or false?
Prove that If L1 is linear and L2 is regular, L1×L2 is a linear Language.
calculate the value and direction of the current in L1 and L2 Assume the resistance of the inductor is zero. 10 mH- L1 +15Vww 1K 2K 3K 1.5K -15V L2-47 mH calculate the value of CEQ 0.33 uF 0.10 uF CAB ? 0.10 uF 0.15 uF 0.33 uF Fig 10-3 Circuit for measuring equivalent capacitance
Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2.This is a Formal Languages and Automata question.
a) if L1 is recognisable but not decidable, L2 is decidable but not recognisable, then prove L1 U L2 is undecidable? b) if L1 is recognisable but not decidable, L2 is recognisable but not decidable, then prove L1 U L2 is undecidable?
Define nor operation for the language as follows. nor(L1, L2) = {w : w E L1 or w E L2} Show that the family of regular languages is closed under the nor operation.
Define nor operation for the language as follows. nor(L1, L2) = {w : w E L1 or w E L2} Show that the family of regular languages is closed under the nor operation.