‘a’ in a-machine is :

Which one of the following is true for the given?

A={(M, w)|M is a turing machine that accepts string w}

Which of the following are decidable problems?

It is less complex to prove the closure properties over regular languages using

Which among the following can be an example of application of finite state machine(FSM)?

Which of the following do we use to form an NFA from a regular expression?

John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?

Which of the following is an application of Finite Automaton?

Which of the following the given language belongs to?
L={a^mb^mc^m| m>=1}

What the does the given CFG defines?
S→aSbS|bSaS|e and w denotes terminal

The intersection of context free language and regular language is _________

Which of the following is not a negative property of Context free languages?

Which among the following is a CFG for the given Language:
L={x $\in${0,1}*|number of zeroes in x=number of one’s in x}

A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B→aC
B→a

For the given Regular expression, the minimum number of terminals required to derive its grammar is:
(011+1)*(01)*

For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:
(011+1)*(01)*

If L1 and L2 are context free languages, which of the following is context free?

Which among the following is the correct option for the given grammar?
G→X111|G1,X->X0|00

L→rLt|tLr|t|r

The given grammar produces a language which is:

The language L ={aⁱ2bⁱ|i>=0} is: