Which of the functions are not performed by the turing machine after reading a symbol?

If a problem has an algorithm to answer it, we call it _________

Which of the following are undecidable problems?

Diagonalization can be useful in:

If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be

Under which of the following operation, NFA is not closed?

Which of the following methods is suitable for conversion of DFA to RE?

P, O, R be regular expression over$\Sigma$, P is not ε, then
R = Q + RP has a unique solution:

Which among the following are incorrect regular identities?

Simplify the following regular expression:
$\epsilon$+1*(011) *(1*(011) *) *

Statement 1: Ambiguity is the property of grammar but not the language.
Statement 2: Same language can have more than one grammar.
Which of the following options are correct with respect to the given statements?

Let G=(V, T, P, S)
where a production can be written as:
S→aAS|a
A→SbA|ba|SS
Which of the following string is produced by the grammar?

Which among the following is incorrect with reference to a derivation tree?

An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such that a change in those could make the expression correct.
L(G)={w in T*|S→*w}

A→aA| a| b

The number of steps to form aab:

Which of the following does not have left recursions?

The format: A→aB refers to which of the following?

Which of the production rule can be accepted by Chomsky grammar?

Every grammar in Chomsky Normal Form is:

If the start symbol is one of those symbols which produce no terminal through any sequence, the CFL is said to be