Match List I with List II. List I: (A) Type 0, (B) Type 1, (C) Type 2, (D) Type 3. List II: (I) Finite automata, (II) Turing machine, (III) Linear bounded automata, (IV) Pushdown automata.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
Explanation
Type 0 ↔ Turing machines; Type 1 ↔ linear bounded automata; Type 2 ↔ pushdown automata; Type 3 ↔ finite automata.
More Theory of Computation and Compilers questions
- Statement I: The LALR parser is more powerful than the canonical LR parser. Statement II: The SLR parser is more powerful than LALR. Which…
- Statement I: CFLs are closed under homomorphism. Statement II: CFLs are closed under complement. Which is correct?
- Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in. Reason (R): This can b…
- Which of the following languages are not regular? A. L = {(01)ⁿ0ᵏ | n > k, k ≥ 0} B. L = {cⁿbᵏaⁿ⁺ᵏ | n ≥ 0, k ≥ 0} C. L = {0ⁿ1ᵏ | n ≠ k}
- Any string of terminals generated by the CFG S → XY, X → 0X | 1X | 0, Y → Y0 | Y1 | 0 (S is the start symbol)
- Let L1 = {0ⁿ1ⁿ0ᵐ | n ≥ 1, m ≥ 1}, L2 = {0ⁿ1ᵐ0ᵐ | n ≥ 1, m ≥ 1}, L3 = {0ⁿ1ⁿ0ⁿ | n ≥ 1}. Which are correct? A. L3 = L1 ∩ L2. B. L1 and L2 are…