MadeEasy Full Length Test 2019: Theory of Computation - Identify Class Languages

Question

Consider the following language over ∑={0,1}

$L_{1} = \left \{ a^{\left \lfloor \frac{m}{n} \right \rfloor}| m,n \geq 1; n<m \right \}$

$L_{2} = \left \{ a^{m^{n}}| m,n \geq 1; n<m \right \}$

Which of them are regular?

• A. Both L1 and L2
• B. Only L2
• C. Only L1
• D. None

Ans. A. Both

Please explain.

 

Comments

Yeah saw that.. :/

This one is from Korth

---

Hmm this  Made-easy Mock1 has lots of mistakes  ~_~

btw both B+ / B  tree use both sparse as well dense nah ??

---

Yes..as far as I know.. :P