Will be really greatful if you could solve all.

Thumbs up!

Consider the language, L. of Os and 1s in any order such that the every 1 is followed by at least two Os. For example: 01001000 L. CEL. 01001 EL. What class of language is L? O Regular, but not finite O Context-free, but not regular Decidable, but not context-free O Finite Consider the language, L. of Os and 1s in any order such that there are the same number of Os as 1s. For example: 010101 L, 111000 L, L, 11100 & L. What class of language is L? O Regular, but not finite o Context-free, but not regular Decidable, but not context-free Finite Consider the language. L. of Os and is in any order such that there are the same number of Os as 1s and that the number of Os and 1s is within 3 of each other for every prefix. That is, while reading a word in L. after reading the first n symbols, there are at most 3 more Os than is or at most 3 more Is than Os. For example: 0101010101 1,00011101 EL, EL.00000111111 What class of language is ? Regular, but not turite Context-tree, but not regular Decidable, but not context.free Consider the language, L = {w = 0"1"0"1" : n > Om >0}. For example: 00010001 L, 01110111 L, & L, 00010111 L. What class of language is L? O Regular, but not finite O Context-free, but not regular Decidable, but not context-free O Finite Consider the language, L , define by the following grammar: ({S,T,U,V},{0,1}, R, S) where R is the following: S 1T|OU T 1S|OV U +18|0T V 1V|OV What class of language is L ? O Regular, but not finite w o Context-free, but not regular Decidable, but not context-free O Finite