Construct a turing machine which accepts a string with ‘aba’ as its substring.

Which of the following regular expression resembles the given diagram?

What does the following transition graph shows:

The following turing machine acts like:

If T1 and T2 are two turing machines. The composite can be represented using the expression:

Which of the following technique is used to find whether a natural language is not recursive ennumerable?

A turing machine operates over:

A turing machine is a

d(q,X)=(r,Y,D) where D cannot be:

The machine accept the string by entering into hA or it can:

The number of states required to automate the last question i.e. {a,b}*{aba}{a,b}* using finite automata:

Which of the problems were not answered when the turing machine was invented?

For the given set of code, the grammar representing real numbers in Pascal has error in one of the six lines. Fetch the error.
(1) →
(2) →| epsilon
(3) → | epsilon
(4) → ‘E’ | epsilon
(5) → + | – | epsilon
(6) → 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

The language accepted by Push down Automaton:

A language accepted by Deterministic Push down automata is closed under which of the following?