TOC Rapid Quiz - 1

Consider the following PDA for L = aⁿbⁿ :
 
We want to check whether the string a⁴b⁴ belongs to the language L or not. A single move in PDA causes 5 nanoseconds delay. Find the total delay in nanoseconds to check the membership of the string.

Consider the regular expression , what is the total number of strings generated by the language with length less than 3 ?

Let ′r′ be a regular expression, then which of the following statements is/are TRUE for every ′r′?

S1:There exists 'x' which satisfies property r+x=x

S2:There exists 'y' which satisfies property r.y=y

Assume X1 will always be the symbol 0, X2 will be 1, and X3 will be B, the blank
Refer the direction L as and direction R as
Encode the transition rule,
(, ) = (, ) for some integers i, j, k, l, m by the string

Let the TM M =
If the transition function 𝛿 of a given TM consists of the rules
q₁
(q₁, 1) = (q₃, 0, R)
(q₁, 0) = (q₂, 1, R)
(q₂, B) = (q₃, 1, R)
(q₃, B) = (q₃, 1, L)
Then which of the following is a valid code of a transition rule of the TM?