A) What should the string length L1 be?
B) What should the string length L2 be?
A) What should the string length L1 be? B) What should the string length L2 be?
For Language L1 and L2 prove or disprove (L1 union L2)*=L1* intersection L2*
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.
Let L1 = L(a∗baa∗) and L2 = L(aba∗). Find L1/L2.This is a Formal Languages and Automata question.
A box is cubical with sides of proper lengths L1 = L2 = L3 = 1.5
m, as shown in the figure below, when viewed in its own rest frame.
This block moves parallel to one of its edges with a speed of 0.95c
past an observer.
(a) What shape does it appear to have to this observer?
(b) What is the length of each side as measured by this
observer? (Assume that the side that the block is moving...
For L1 = {a, bb,c} and L2 = {ac,ca}, calculate L1L2 , L1 ∪L2, and L13.
The languages L1 = {anbm | m = n or m = 2n } and L2 = {a n b m | n <= m <= 2n } are context free. a. Choose one of the languages and write a CFG for it. b. Write the PDA that comes from your grammar (part a). Show the first 4 moves it would make on some string in your language (of length at least 4). Be sure to show state, input, and...
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?
PYTHON QUESTION
2. Write a function called first_day_greater that takes two lists, L1 and L2 , representing the daily measured weights of rat 1 and rat 2, respectively, and returns the index of the first day for which the weight for the fist rat is greater than the weight of the second rat.If there are no such days then the function should return -1. You may NOT assume that L1 and L2 are the same length. Use the following to...
Let L1 = {ω|ω begins with a 1 and ends with a 0}, L2 = {ω|ω has
length at least 3 and its third symbol is a 0}, and L3 = {ω| every
odd position of ω is a 1} where L1, L2, and L3 are all languages
over the alphabet {0, 1}. Draw finite automata (may be NFA) for L1,
L2, and L3 and for each of the following (note: L means complement
of L):
Let L w begins...