Let l be a language over the alphabet å= {a, b} that contains strings over {a, b} such that each string has at least one a and every a is immediately followed by odd number (1, 3, 5, …) of bs.

e. g. ab, abab, abbb, ababbb, abbbab,… give a regular expression that describes l

Icould really use some with this question.

Click the arrows to advance or review slides. mapping carbohydrates to food carbohydrates (grams) 15 food (quantity) bread (1 slice) pasta (1/3 cup) apple (1 medium) mashed potatoes (1/2 cup) broccoli (1/2 cup) carrots (1/2 cup) milk (1 cup) yogurt (6 oz.) 12 12 is jennifer's relation a function? yes no f 1 of 2 → jennifer figure out the difference between a function and a relation by answering the questions about her food choices

One number is 4 less than 3 times a second number. if 3 more than two times the first number is decreased by 2 times the second number, the result is 11. use the substitution method. what is the first number?