Consider the languages L1 = ? and L2 = {1}. Which one of the...

MCQ

Consider the languages L1 = ? and L2 = {1}. Which one of the following represents L*₁? L*₁ L*₂ ?

{?}

{?, 1}

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Given the following two languages: L1 = {anban|n > 0} L2 = {an b an bn + 1|n > 0} Which of the following is correct ?

L₁ is context free language and L₂ is not context free language

L₁ is not context free language and L₂ is context free language

Both L₁ and L₂ are context free languages

Both L₁ and L₂ are not context free languages

Discussion

MCQ

What is the number of steps required to derive the string ((() ()) ())

S ? SS
S ? (S)
S ? ?

Discussion

MCQ

Let L = {0ⁿ1ⁿ|n ? 0} be a context free language. Which of the following is correct ?

L` is context free and L^k is not context free for any k ? 1.

L` is not context free and L^k is not context free for any k ? 1

Both L` and L^k is for any k ? 1 are context free.

Both L` and L^k is for any k ? 1 are not context free

Discussion

MCQ

Which of the following pairs have DIFFERENT expressive power?

Deterministic finite automata(DFA) and Non-deterministic finite automata(NFA)

Deterministic push down automata(DPDA)and Non-deterministic push down automata(NPDA)

Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine

Single-tape Turing machine and multi-tape Turing machine

Discussion

MCQ

Let L = L1?L2, where L1 and L2 are languages as defined below:

L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 }
L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 }
Then L is

Not recursive

Regular

Context free but not regular

Recursively enumerable but not context free

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics