Which of the following problems occur?i) Does a given program ever produce an output? ii) If L is a CFL, then is L’ is also context-free? iii) L’ is regular only if L is regular? iv) If L is a recursive language, then, L’ is also recursive?

Which of the following problems occur?

i) Does a given program ever produce an output?
ii) If L is a CFL, then is L’ is also context-free?
iii) L’ is regular only if L is regular?
iv) If L is a recursive language, then, L’ is also recursive?

i, ii, iii, iv

i, ii

ii, iii, iv

iii, iv

Similar Questions

Can a DFA simulate NDFA?

Yes

Sometimes

Depends on NDFA

Find the wrong statement?

The language accepted by finite automata are the languages denoted by regular expression

Every DFA has a regular expression denoting its language

For a regular expression r, there does not exists NDFA with L® ant transit that accept

None of the mentioned

Regular expression a/b denotes which of the following set?

{a}

{€,a,b}

{a,b}

{ab}

Which behaviour of a NFA can be stimulated by DFA?

Always

Sometimes

Never

Depends on NFA

For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.

True

False

What is the relation between NFA-accepted languages and DFA accepted languages?

In regular expressions, the operator ‘*’ stands for?

Concatenation

Selection

Iteration

A deterministic finite automation (DFA)D with alphabet ∑ = {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D?

The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Finite state automata

Deterministic pushdown automata

Non-deterministic pushdown automata

Turing machine

10.

Is empty string a valid input in Ndfa.

True

COMPILER DESIGN TOPICS