Which of the following is right?...

MCQ

Which of the following is right?

A Context free language can be accepted by a deterministic PDA

union of 2 CFLs is context free

The intersection of two CFLs is context free

The complement of CFLs is context free

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

what does the following segment of codes here?grep -i men heroes.txt

manuelly opens a file called hereos.txt

managed hereos.txt

search for man in the file heroes.txt

none of the mentioned

Discussion

MCQ

Regular expressions are used to represent which language

Recursive language

Context free language

Regular language

All of these

Discussion

MCQ

Which of the following statement is true?

Every language that is defined by regular expression can also be defined by finite automata

Every language defined by finite automata can also be defined by regular expression

We can convert regular expressions into finite automata

All of these

Discussion

MCQ

Regular Expression R and the language it describes can be represented as:

R, R(L)

L(R), R(L)

R, L(R)

All of the mentioned

Discussion

MCQ

An FSM with

M can be transformed to Numeral relabeling its states

M can be transformed to N, merely relabeling its edges

Both of the mentioned

None of the mentioned

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